31 (number)

Last updated
← 30 31 32 →
Cardinal thirty-one
Ordinal 31st
(thirty-first)
Factorization prime
Prime 11th
Divisors 1, 31
Greek numeral ΛΑ´
Roman numeral XXXI
Binary 111112
Ternary 10113
Senary 516
Octal 378
Duodecimal 2712
Hexadecimal 1F16

31 (thirty-one) is the natural number following 30 and preceding 32. It is a prime number.

Contents

Mathematics

31 is the 11th prime number. It is a superprime and a self prime (after 3, 5, and 7), as no integer added up to its base 10 digits results in 31. [1] It is the third Mersenne prime of the form 2n − 1, [2] and the eighth Mersenne prime exponent, [3] in-turn yielding the maximum positive value for a 32-bit signed binary integer in computing: 2,147,483,647. After 3, it is the second Mersenne prime not to be a double Mersenne prime, while the 31st prime number (127) is the second double Mersenne prime, following 7. [4] On the other hand, the thirty-first triangular number is the perfect number 496, of the form 2(5 − 1)(25 − 1) by the Euclid-Euler theorem. [5] 31 is also a primorial prime like its twin prime (29), [6] [7] as well as both a lucky prime [8] and a happy number [9] like its dual permutable prime in decimal (13). [10]

31 is the number of regular polygons with an odd number of sides that are known to be constructible with compass and straightedge, from combinations of known Fermat primes of the form 22n + 1 (they are 3, 5, 17, 257 and 65537). [11] [12]

31 is a centered pentagonal number. Centered pentagonal number 31.svg
31 is a centered pentagonal number.

Only two numbers have a sum-of-divisors equal to 31: 16 (1 + 2 + 4 + 8 + 16) and 25 (1 + 5 + 25), respectively the square of 4, and of 5. [13]

31 is the 11th and final consecutive supersingular prime. [14] After 31, the only supersingular primes are 41, 47, 59, and 71.

31 is the first prime centered pentagonal number, [15] the fifth centered triangular number, [16] and a centered decagonal number. [17]

For the Steiner tree problem, 31 is the number of possible Steiner topologies for Steiner trees with 4 terminals. [18]

At 31, the Mertens function sets a new low of −4, a value which is not subceded until 110. [19]

31 is a repdigit in base 2 (11111) and in base 5 (111).

The cube root of 31 is the value of π correct to four significant figures:

The first five Euclid numbers of the form p1 × p2 × p3 × ... × pn + 1 (with pn the nth prime) are prime: [20]

The following term, 30031 = 59 × 509 = 2 × 3 × 5 × 7 × 11 × 13 + 1, is composite. [lower-alpha 1] The next prime number of this form has a largest prime p of 31: 2 × 3 × 5 × 7 × 11 × 13 × ... × 31 + 1 ≈ 8.2 × 1033. [21]

While 13 and 31 in base-ten are the proper first duo of two-digit permutable primes and emirps with distinct digits in base ten, 11 is the only two-digit permutable prime that is its own permutable prime. [10] [22] Meanwhile 1310 in ternary is 1113 and 3110 in quinary is 1115, with 1310 in quaternary represented as 314 and 3110 as 1334 (their mirror permutations 3314 and 134, equivalent to 61 and 7 in decimal, respectively, are also prime). (11, 13) form the third twin prime pair [6] between the fifth and sixth prime numbers whose indices add to 11, itself the prime index of 31. [23] Where 31 is the prime index of the fourth Mersenne prime, [2] the first three Mersenne primes (3, 7, 31) sum to the thirteenth prime number, 41. [23] [lower-alpha 2] 13 and 31 are also the smallest values to reach record lows in the Mertens function, of −3 and −4 respectively. [25]

The numbers 31, 331, 3331, 33331, 333331, 3333331, and 33333331 are all prime. For a time it was thought that every number of the form 3w1 would be prime. However, the next nine numbers of the sequence are composite; their factorisations are:

The next term (3171) is prime, and the recurrence of the factor 31 in the last composite member of the sequence above can be used to prove that no sequence of the type RwE or ERw can consist only of primes, because every prime in the sequence will periodically divide further numbers.[ citation needed ]

31 is the maximum number of areas inside a circle created from the edges and diagonals of an inscribed six-sided polygon, per Moser's circle problem. [26] It is also equal to the sum of the maximum number of areas generated by the first five n-sided polygons: 1, 2, 4, 8, 16, and as such, 31 is the first member that diverges from twice the value of its previous member in the sequence, by 1.

Icosahedral symmetry contains a total of thirty-one axes of symmetry; six five-fold, ten three-fold, and fifteen two-fold. [27]

In science

Astronomy

In sports

In other fields

Thirty-one is also:

Notes

  1. ↑ On the other hand, 13 is a largest p of a primorial prime of the form pn# − 1 = 30029 (sequence A057704 in the OEIS).
  2. ↑ Also, the sum between the sum and product of the first two Mersenne primes is (3 + 7) + (3 × 7) = 10 + 21 = 31, where its difference (11) is the prime index of 31. [23] Thirty-one is also in equivalence with 14 + 17, which are respectively the seventh composite [24] and prime numbers, [23] whose difference in turn is three.

Related Research Articles

11 (eleven) is the natural number following 10 and preceding 12. It is the first repdigit. In English, it is the smallest positive integer whose name has three syllables.

19 (nineteen) is the natural number following 18 and preceding 20. It is a prime number.

23 (twenty-three) is the natural number following 22 and preceding 24.

71 (seventy-one) is the natural number following 70 and preceding 72.

73 (seventy-three) is the natural number following 72 and preceding 74. In English, it is the smallest natural number with twelve letters in its spelled out name.

32 (thirty-two) is the natural number following 31 and preceding 33.

37 (thirty-seven) is the natural number following 36 and preceding 38.

61 (sixty-one) is the natural number following 60 and preceding 62.

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.

300 is the natural number following 299 and preceding 301.

400 is the natural number following 399 and preceding 401.

500 is the natural number following 499 and preceding 501.

600 is the natural number following 599 and preceding 601.

800 is the natural number following 799 and preceding 801.

2000 is a natural number following 1999 and preceding 2001.

100,000 (one hundred thousand) is the natural number following 99,999 and preceding 100,001. In scientific notation, it is written as 105.

5 (five) is a number, numeral and digit. It is the natural number, and cardinal number, following 4 and preceding 6, and is a prime number. It has garnered attention throughout history in part because distal extremities in humans typically contain five digits.

744 is the natural number following 743 and preceding 745.

30,000 is the natural number that comes after 29,999 and before 30,001.

41 (forty-one) is the natural number following 40 and preceding 42.

References

  1. ↑ "Sloane's A003052 : Self numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  2. 1 2 Sloane, N. J. A. (ed.). "SequenceA000668(Mersenne primes (primes of the form 2^n - 1).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  3. ↑ Sloane, N. J. A. (ed.). "SequenceA000043(Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  4. ↑ Sloane, N. J. A. (ed.). "SequenceA077586(Double Mersenne primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  5. ↑ "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia oof Integer Sequences. OEIS Foundation. Retrieved 2022-09-30.
  6. 1 2 Sloane, N. J. A. (ed.). "SequenceA228486(Near primorial primes: primes p such that p+1 or p-1 is a primorial number (A002110))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  7. ↑ Sloane, N. J. A. (ed.). "SequenceA077800(List of twin primes {p, p+2}.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  8. ↑ "Sloane's A031157 : Numbers that are both lucky and prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  9. ↑ "Sloane's A007770 : Happy numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  10. 1 2 Sloane, N. J. A. (ed.). "SequenceA003459(Absolute primes (or permutable primes): every permutation of the digits is a prime.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  11. ↑ Conway, John H.; Guy, Richard K. (1996). "The Primacy of Primes". The Book of Numbers. New York, NY: Copernicus (Springer). pp. 137–142. doi:10.1007/978-1-4612-4072-3. ISBN   978-1-4612-8488-8. OCLC   32854557. S2CID   115239655.
  12. ↑ Sloane, N. J. A. (ed.). "SequenceA004729(... the 31 regular polygons with an odd number of sides constructible with ruler and compass)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-05-26.
  13. ↑ Sloane, N. J. A. (ed.). "SequenceA000203(The sum of the divisors of n. Also called sigma_1(n).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-01-23.
  14. ↑ "Sloane's A002267 : The 15 supersingular primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  15. ↑ "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  16. ↑ "Sloane's A005448 : Centered triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  17. ↑ "Sloane's A062786 : Centered 10-gonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  18. ↑ Hwang, Frank. (1992). The Steiner tree problem. Richards, Dana, 1955-, Winter, Pawel, 1952-. Amsterdam: North-Holland. p. 14. ISBN   978-0-444-89098-6. OCLC   316565524.
  19. ↑ Sloane, N. J. A. (ed.). "SequenceA002321(Mertens's function)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-07.
  20. ↑ Sloane, N. J. A. (ed.). "SequenceA006862(Euclid numbers: 1 + product of the first n primes.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-10-01.
  21. ↑ Conway, John H.; Guy, Richard K. (1996). "The Primacy of Primes". The Book of Numbers. New York, NY: Copernicus (Springer). pp. 133–135. doi:10.1007/978-1-4612-4072-3. ISBN   978-1-4612-8488-8. OCLC   32854557. S2CID   115239655.
  22. ↑ Sloane, N. J. A. (ed.). "SequenceA006567(Emirps (primes whose reversal is a different prime).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-06-16.
  23. 1 2 3 4 Sloane, N. J. A. (ed.). "SequenceA00040(The prime numbers.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-02-09.
  24. ↑ Sloane, N. J. A. (ed.). "SequenceA002808(The composite numbers: numbers n of the form x*y for x greater than 1 and y greater than 1.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-02-10.
  25. ↑ Sloane, N. J. A. (ed.). "SequenceA051402(Inverse Mertens function: smallest k such that |M(k)| is n, where M(x) is Mertens's function A002321.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-02-08.
  26. ↑ "Sloane's A000127 : Maximal number of regions obtained by joining n points around a circle by straight lines". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-09-30.
  27. ↑ Hart, George W. (1998). "Icosahedral Constructions" (PDF). In Sarhangi, Reza (ed.). Bridges: Mathematical Connections in Art, Music, and Science. Proceedings of the Bridges Conference. Winfield, Kansas. p. 196. ISBN   978-0966520101. OCLC   59580549. S2CID   202679388.{{cite book}}: CS1 maint: location missing publisher (link)
  28. ↑ "Tureng - 31 çekmek - Türkçe İngilizce Sözlük". tureng.com. Retrieved 2023-01-18.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.