23 (number)

← 22 23 24 →
← 20 21 22 23 24 25 26 27 28 29 → List of numbers Integers ← 0 10 20 30 40 50 60 70 80 90 →
Cardinal	twenty-three
Ordinal	23rd (twenty-third)
Numeral system	trivigesimal
Factorization	prime
Prime	9th
Divisors	1, 23
Greek numeral	ΚΓ´
Roman numeral	XXIII, xxiii
Binary	101112
Ternary	2123
Senary	356
Octal	278
Duodecimal	1B12
Hexadecimal	1716

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

In mathematics

Twenty-three is the ninth prime number, the smallest odd prime that is not a twin prime. ^[1] It is, however, a cousin prime with 19, and a sexy prime with 17 and 29; while also being the largest member of the first prime sextuplet (7, 11, 13, 17, 19, 23). ^[2] Twenty-three is also the next to last member of the first Cunningham chain of the first kind (2, 5, 11, 23, 47), ^[3] and the sum of the prime factors of the second set of consecutive discrete semiprimes, (21, 22). 23 is the smallest odd prime to be a highly cototient number, as the solution to ${\displaystyle x-\phi (x)}$ for the integers 95, 119, 143, and 529. ^[4]

• 23 is the second Smarandache–Wellin prime in base ten, as it is the concatenation of the decimal representations of the first two primes (2 and 3) and is itself also prime, ^[5] and a happy number. ^[6]
• The sum of the first nine primes up to 23 is a square: ${\displaystyle 2+3+\dots +23=100=10^{2}}$ and the sum of the first 23 primes is 874, which is divisible by 23, a property shared by few other numbers. ^{[7] [8]}
• It is the fifth factorial prime, ^[9] and since 14! + 1 is a multiple of 23, but 23 is not one more than a multiple of 14, 23 is the first Pillai prime. ^[10]
• In the list of fortunate numbers, 23 occurs twice, since adding 23 to either the fifth or eighth primorial gives a prime number (namely 2333 and 9699713). ^[11]
• 23 has the distinction of being one of two integers that cannot be expressed as the sum of fewer than 9 cubes of positive integers (the other is 239). See Waring's problem.
• The twenty-third highly composite number 20,160 ^[12] is one less than the last number (the 339th super-prime 20,161) that cannot be expressed as the sum of two abundant numbers. ^[13]

Otherwise, ${\displaystyle 46=23\times 2}$ is the largest even number that is not the sum of two abundant numbers.

• 23 is the second Woodall prime, ^[14] and an Eisenstein prime with no imaginary part and real part of the form ${\displaystyle 3n-1.}$ It is the fifth Sophie Germain prime ^[15] and the fourth safe prime. ^[16]
• 23 is the number of trees on 8 unlabeled nodes. ^[17] It is also a Wedderburn–Etherington number, which are numbers that can be used to count certain binary trees. ^[18]
• The natural logarithms of all positive integers lower than 23 are known to have binary BBP-type formulae. ^[19]
• 23 is the first prime p for which unique factorization of cyclotomic integers based on the pth root of unity breaks down. ^[20]
• 23 is the smallest positive solution to Sunzi's original formulation of the Chinese remainder theorem.
• 23 is the smallest prime ${\displaystyle p}$ such that the largest consecutive pair of ${\displaystyle p}$-smooth numbers (11859210, 11859211) is the same as the largest consecutive pair of ${\displaystyle (p-1)}$-smooth numbers. ^[21]
• According to the birthday paradox, in a group of 23 or more randomly chosen people, the probability is more than 50% that some pair of them will have the same birthday. ^[22]
  A related coincidence is that 365 times the natural logarithm of 2, approximately 252.999, is very close to the number of pairs of 23 items and 22nd triangular number, 253.
• The first twenty-three odd prime numbers (between 3 and 89 inclusive), are all cluster primes ${\displaystyle p}$ such that every even positive integer ${\displaystyle k\leq p-3}$ can be written as the sum of two prime numbers that do not exceed ${\displaystyle p}$. ^[23]
• 23 is the smallest discriminant of imaginary quadratic fields with class number 3 (negated), ^[24] and it is the smallest discriminant of complex cubic fields (also negated). ^[25]
• The twenty-third permutable prime in decimal ${\displaystyle R_{19}}$ is also the second to be a prime repunit (after ${\displaystyle R_{2}}$), followed by ${\displaystyle R_{23}}$ and ${\displaystyle R_{1031}}$. ^{[26] [27] [28] [29]}

Hilbert's problems are twenty-three problems in mathematics published by German mathematician David Hilbert in 1900.

Mersenne numbers

The first Mersenne number of the form ${\displaystyle 2^{n}-1}$ that does not yield a prime number when inputting a prime exponent is ${\displaystyle 2047=23\times 89,}$ with ${\displaystyle n=11.}$ ^[30]

On the other hand, the second composite Mersenne number contains an exponent ${\displaystyle n}$ of twenty-three: $${\displaystyle M_{23}=2^{23}-1=8\;388\;607=47\times 178\;481}$$

The twenty-third prime number (83) is an exponent to the fourteenth composite Mersenne number, which factorizes into two prime numbers, the largest of which is twenty-three digits long when written in base ten: ^{[31] [32]} $${\displaystyle M_{83}=967...407=167\times 57\;912\;614\;113\;275\;649\;087\;721}$$

Further down in this sequence, the seventeenth and eighteenth composite Mersenne numbers have two prime factors each as well, where the largest of these are respectively twenty-two and twenty-four digits long, $${\displaystyle {\begin{aligned}M_{103}&=101\ldots 007=2\;550\;183\;799\times 3\;976\;656\;429\;941\;438\;590\;393\\M_{109}&=649\ldots 511=745\;988\;807\times 870\;035\;986\;098\;720\;987\;332\;873\\\end{aligned}}}$$

Where prime exponents for ${\displaystyle M_{23}}$ and ${\displaystyle M_{83}}$ add to 106, which lies in between prime exponents of ${\displaystyle M_{103}}$ and ${\displaystyle M_{109}}$, the index of the latter two (17 and 18) in the sequence of Mersenne numbers sum to 35, which is the twenty-third composite number. ^[33]

${\displaystyle 23!}$ is twenty-three digits long in decimal, and there are only three other numbers ${\displaystyle n}$ whose factorials generate numbers that are ${\displaystyle n}$ digits long in base ten: 1, 22, and  24.

In geometry

The Leech lattice Λ₂₄ is a 24-dimensional lattice through which 23 other positive definite even unimodular Niemeier lattices of rank 24 are built, and vice-versa. Λ₂₄ represents the solution to the kissing number in 24 dimensions as the precise lattice structure for the maximum number of spheres that can fill 24-dimensional space without overlapping, equal to 196,560 spheres. These 23 Niemeier lattices are located at deep holes of radii √2 in lattice points around its automorphism group, Conway group ${\displaystyle \mathbb {C} _{0}}$. The Leech lattice can be constructed in various ways, which include:

• By means of a matrix of the form ${\displaystyle \scriptstyle {\begin{pmatrix}Ia&H/2\\H/2&Ib\end{pmatrix}}}$ where ${\displaystyle I}$ is the identity matrix and ${\displaystyle H}$ is a 24 by 24 Hadamard matrix (Z/23Z ∪ ∞) with a = 2 and b = 3, and entries X(∞) = 1 and X(0) = -1 with X(n) the quadratic residue symbol mod 23 for nonzero n.
• Through the extended binary Golay code ${\displaystyle \mathbb {B} _{24}}$ and Witt design ${\displaystyle \mathbb {W} _{24}}$, which produce a construction of the 196,560 minimal vectors in the Leech lattice. The extended binary Golay code is an extension of the perfect binary Golay code ${\displaystyle \mathbb {B} _{23}}$, which has codewords of size  23. ${\displaystyle \mathbb {B} _{23}}$ has Mathieu group ${\displaystyle \mathbb {M} _{23}}$ as its automorphism group, which is the second largest member of the first generation in the happy family of sporadic groups. ${\displaystyle \mathbb {M} _{23}}$ has a minimum faithful complex representation in 22 dimensions and group-3 actions on 253 objects, with 253 equal to the number of pairs of objects in a set of 23 objects. In turn, ${\displaystyle \mathbb {M} _{23}}$ is the automorphism group of Mathieu group ${\displaystyle \mathbb {M} _{24}}$, which works through ${\displaystyle \mathbb {W} _{24}}$ to generate 8-element octads whose individual elements occur 253 times through its entire block design.
• Using Niemer lattice D₂₄ of group order 2²³·24! and Coxeter number 46 = 2·23, it can be made into a module over the ring of integers of quadratic field ${\displaystyle \mathbb {Q} ({\sqrt {-23}})}$, whereby multiplying D₂₄ by a non-principal ideal of the ring of integers yields the Leech lattice.

Conway and Sloane provided constructions of the Leech lattice from all other 23 Niemeier lattices. ^[34]

Twenty-three four-dimensional crystal families exist within the classification of space groups. These are accompanied by six enantiomorphic forms, maximizing the total count to twenty-nine crystal families. ^[35] Five cubes can be arranged to form twenty-three free pentacubes, or twenty-nine distinct one-sided pentacubes (with reflections). ^{[36] [37]}

There are 23 three-dimensional uniform polyhedra that are cell facets inside uniform 4-polytopes that are not part of infinite families of antiprismatic prisms and duoprisms: the five Platonic solids, the thirteen Archimedean solids, and five semiregular prisms (the triangular, pentagonal, hexagonal, octagonal, and decagonal prisms).

23 Coxeter groups of paracompact hyperbolic honeycombs in the third dimension generate 151 unique Wythoffian constructions of paracompact honeycombs. 23 four-dimensional Euclidean honeycombs are generated from the ${\displaystyle {\tilde {B}}_{4}}$ cubic group, and 23 five-dimensional uniform polytopes are generated from the ${\displaystyle \mathrm {D} _{5}}$ demihypercubic group.

In two-dimensional geometry, the regular 23-sided icositrigon is the first regular polygon that is not constructible with a compass and straight edge or with the aide of an angle trisector (since it is neither a Fermat prime nor a Pierpont prime), nor by neusis or a double-notched straight edge. ^[38] It is also not constructible with origami, however it is through other traditional methods for all regular polygons. ^[39]

In religion

• In Biblical numerology, it is associated with Psalm 23, also known as the Shepherd Psalm. It is possibly the most quoted and best known Psalm. ^{[40] [41]}
• Principia Discordia , the sacred text of Discordianism, holds that 23 (along with the discordian prime 5) is one of the sacred numbers of Eris, goddess of discord.

In popular culture

Film and television

• In the TV series Lost , 23 is one of the 6 reoccurring numbers (4, 8, 15, 16, 23, 42) that appear frequently throughout the show.

Other fields

See also: List of highways numbered 23

• 23 skidoo (phrase) (sometimes 23 skiddoo) is an American slang phrase popularized during the early 20th century. 23 skidoo has been described as "perhaps the first truly national fad expression and one of the most popular fad expressions to appear in the U.S".
• The 23 enigma, proposed by William S. Burroughs, plays a prominent role in the plot of the Illuminatus! Trilogy by Robert Shea and Robert Anton Wilson.
  • The Number 23 is a 2007 film starring Jim Carrey about a man who becomes obsessed with the 23 enigma. ^[42]
  • The number 23 is used a lot throughout the visuals and music by the band Gorillaz, who have even devoted a whole page of their autobiography Rise Of The Ogre to the 23 enigma theory.

References

1. Sloane, N. J. A. (ed.). "SequenceA007510(Single (or isolated or non-twin) primes: Primes p such that neither p-2 nor p+2 is prime.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 5 December 2022.
2. Sloane, N. J. A. (ed.). "SequenceA001223(Prime gaps: differences between consecutive primes.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 11 June 2023.
3. Sloane, N. J. A. (ed.). "SequenceA192580(Monotonic ordering of set S generated by these rules: if x and y are in S and xy+1 is a prime, then xy+1 is in S, and 2 is in S.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 11 June 2023.

   "2, 5, 11, 23, 47 is the complete Cunningham chain that begins with 2. Each term except the last is a Sophie Germain prime A005384."

4. Sloane, N. J. A. (ed.). "SequenceA100827(Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
5. Sloane, N. J. A. (ed.). "SequenceA069151(Concatenations of consecutive primes, starting with 2, that are also prime)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
6. Sloane, N. J. A. (ed.). "SequenceA007770(Happy numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
7. (sequence A045345 in the OEIS )
8. "Puzzle 31.- The Average Prime number, APN(k) = S(Pk)/k". www.primepuzzles.net. Retrieved 29 November 2022.
9. Sloane, N. J. A. (ed.). "SequenceA088054(Factorial primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
10. Sloane, N. J. A. (ed.). "SequenceA063980(Pillai primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
11. Sloane, N. J. A. (ed.). "SequenceA005235(Fortunate numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
12. Sloane, N. J. A. (ed.). "SequenceA002182(Highly composite numbers, definition (1): numbers n where d(n), the number of divisors of n (A000005), increases to a record.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 9 October 2023.
13. Sloane, N. J. A. (ed.). "SequenceA048242(Numbers that are not the sum of two abundant numbers (not necessarily distinct).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 9 October 2023.
14. Sloane, N. J. A. (ed.). "SequenceA050918(Woodall primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
15. Sloane, N. J. A. (ed.). "SequenceA005384(Sophie Germain primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
16. Sloane, N. J. A. (ed.). "SequenceA005385(Safe primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
17. "Sloane's A000055: Number of trees with n unlabeled nodes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on 29 November 2010. Retrieved 19 December 2021.
18. Sloane, N. J. A. (ed.). "SequenceA001190(Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
19. Chamberland, Marc. "Binary BBP-Formulae for Logarithms and Generalized Gaussian-Mersenne Primes" (PDF).
20. Weisstein, Eric W. "Cyclotomic Integer". mathworld.wolfram.com. Retrieved 15 January 2019.
21. Sloane, N. J. A. (ed.). "SequenceA228611(Primes p such that the largest consecutive pair of ${\displaystyle p}$-smooth integers is the same as the largest consecutive pair of ${\displaystyle p-1}$-smooth integers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 31 May 2016.
22. Weisstein, Eric W. "Birthday Problem". mathworld.wolfram.com. Retrieved 19 August 2020.
23. Sloane, N. J. A. (ed.). "SequenceA038133(From a subtractive Goldbach conjecture: odd primes that are not cluster primes.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 26 December 2022.
24. Sloane, N. J. A. (ed.). "SequenceA006203(Discriminants of imaginary quadratic fields with class number 3 (negated).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 20 March 2024.
25. Sloane, N. J. A. (ed.). "SequenceA023679(Discriminants of complex cubic fields (negated).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 20 March 2024.
26. Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN   1475717385
27. 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 10 January 2024.
28. Sloane, N. J. A. (ed.). "SequenceA004022(Primes of the form (10^k - 1)/9. Also called repunit primes or repdigit primes.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 10 January 2024.
29. Sloane, N. J. A. (ed.). "SequenceA004023(Indices of prime repunits: numbers n such that 11...111 (with n 1's) equal to (10^n - 1)/9 is prime.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 10 January 2024.
30. Sloane, N. J. A. (ed.). "SequenceA000225(Mersenne numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 16 February 2023.
31. Sloane, N. J. A. (ed.). "SequenceA136030(Smallest prime factor of composite Mersenne numbers.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 12 June 2023.
32. Sloane, N. J. A. (ed.). "SequenceA136031(Largest prime factor of composite Mersenne numbers.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 12 June 2023.
33. Sloane, N. J. A. (ed.). "SequenceA002808(The composite numbers: numbers n of the form x*y for x > 1 and y > 1.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 9 January 2024.
34. Conway, John Horton; Sloane, N. J. A. (1982). "Twenty-three constructions for the Leech lattice". Proceedings of the Royal Society A . 381 (1781): 275–283. Bibcode:1982RSPSA.381..275C. doi:10.1098/rspa.1982.0071. ISSN   0080-4630. MR   0661720. S2CID   202575295.
35. Sloane, N. J. A. (ed.). "SequenceA004032(Number of n-dimensional crystal families.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 21 November 2022.
36. Sloane, N. J. A. (ed.). "SequenceA000162(Number of three dimensional polyominoes (or polycubes) with n cells.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 6 January 2023.
37. Sloane, N. J. A. (ed.). "SequenceA038119(Number of n-celled solid polyominoes (or free polycubes, allowing mirror-image identification))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
38. Arthur Baragar (2002) Constructions Using a Compass and Twice-Notched Straightedge, The American Mathematical Monthly, 109:2, 151-164, doi : 10.1080/00029890.2002.11919848
39. P. Milici, R. Dawson The equiangular compass December 1st, 2012, The Mathematical Intelligencer, Vol. 34, Issue 4 https://www.researchgate.net/profile/Pietro_Milici2/publication/257393577_The_Equiangular_Compass/links/5d4c687da6fdcc370a8725e0/The-Equiangular-Compass.pdf
40. ""The Lord is My Shepherd, I Shall Not Want" – Meaning of Psalm 23 Explained". Christianity.com. Retrieved 7 June 2021.
41. Miriam Dunson, A Very Present Help: Psalm Studies for Older Adults. New York: Geneva Press (1999): 91. "Psalm 23 is perhaps the most familiar, the most loved, the most memorized, and the most quoted of all the psalms."
42. The Number 23 (2007) – Joel Schumacher | Synopsis, Characteristics, Moods, Themes and Related | AllMovie , retrieved 12 August 2020

External links

• 23 facts, 23 images, 23 gallery, and links to other 23's