10,000,000

Selected 8-digit numbers (10,000,001–99,999,999)

10,000,001 to 19,999,999

• 10,000,019 = Smallest 8-digit prime number
• 10,001,628 = Smallest triangular number with 8 digits and the 4,472nd triangular number
• 10,004,569 = 31632, the smallest 8-digit square
• 10,077,696 = 2163 = 69, the smallest 8-digit cube
• 10,172,638 = Number of reduced trees with 32 nodes
• 10,321,920 = Double factorial of 16
• 10,556,001 = 32492 = 574
• 10,600,510 = Number of signed trees with 14 nodes
• 10,609,137 = Leyland number using 6 & 9 (69 + 96)
• 10,976,184 = Logarithmic number
• 11,111,111 = Repunit
• 11,316,496 = 33642 = 584
• 11,390,625 = 33752 = 2253 = 156
• 11,405,773 = Leonardo prime
• 11,436,171 = Keith number
• 11,485,154 = Markov number
• 11,881,376 = 265
• 11,943,936 = 34562
• 12,117,361 = 34812 = 594
• 12,252,240 = Highly composite number, smallest number divisible by the numbers from 1 to 18
• 12,648,430 = Hexadecimal C0FFEE, resembling the word "coffee"; used as a placeholder in computer programming, see hexspeak.
• 12,890,625 = 1-automorphic number
• 12,960,000 = 36002 = 604 = (3·4·5)4, Plato's "nuptial number" (Republic VIII; see regular number)
• 12,988,816 = Number of different ways of covering an 8-by-8 square with 32 1-by-2 dominoes
• 13,079,255 = Number of free 16-ominoes
• 13,782,649 = Markov number
• 13,845,841 = 37212 = 614
• 14,348,907 = 2433 = 275 = 315
• 14,352,282 = Leyland number = 315 + 153
• 14,549,535 = Smallest number divisible by the first 10 odd numbers (1, 3, 5, 7, 9, 11, 13, 15, 17 and 19).
• 14,776,336 = 38442 = 624
• 14,828,074 = Number of trees with 23 unlabeled nodes
• 14,930,352 = Fibonacci number
• 15,485,863 = 1,000,000th prime number
• 15,548,694 = Fine number
• 15,600,000 = The number of years equal to the half-life of curium-247 (247Cm), the longest-lived isotope of curium
• 15,625,000 = 2502
• 15,752,961 = 39692 = 634
• 15,994,428 = Pell number
• 16,003,008 = 2523
• 16,609,837 = Markov number
• 16,733,779 = Number of ways to partition {1,2,...,10} and then partition each cell (block) into sub-cells.
• 16,777,216 = 40962 = 2563 = 644 = 166 = 88 = 412 = 224 — hexadecimal "million" (0x1000000), number of possible colors in 24/32-bit Truecolor computer graphics
• 16,777,792 = Leyland number = 224 + 242
• 16,797,952 = Leyland number = 412 + 124
• 16,964,653 = Markov number
• 17,016,602 = Index of a prime Woodall number
• 17,210,368 = 285
• **17,334,801 ** = Number of 31-bead necklaces (turning over is allowed) where complements are equivalent
• 17,650,828 = 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88
• 17,820,000 = Number of primitive polynomials of degree 30 over GF(2)
• 17,850,625 = 42252 = 654
• 17,896,832 = Number of 30-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
• 18,199,284 = Motzkin number
• 18,407,808 = Number of primitive polynomials of degree 29 over GF(2)
• 18,974,736 = 43562 = 664
• 19,487,171 = 117
• 19,680,277 = Wedderburn-Etherington number
• 19,987,816 = Palindromic in 3 consecutive bases: 41AAA1413, 292429214, 1B4C4B115

20,000,000 to 29,999,999

• 20,031,170 = Markov number
• 20,151,121 = 44892 = 674
• 20,511,149 = 295
• 20,543,579 = Number of reduced trees with 33 nodes
• 20,797,002 = Number of triangle-free graphs on 13 vertices
• 21,381,376 = 46242 = 684
• 21,531,778 = Markov number
• 21,621,600 = 13th colossally abundant number, 13th superior highly composite number
• 22,222,222 = repdigit
• 22,235,661 = 33×77
• 22,667,121 = 47612 = 694
• 24,010,000 = 49002 = 704
• 24,137,569 = 49132 = 2893 = 176
• 24,157,817 = Fibonacci number, Markov number
• 24,300,000 = 305
• 24,678,050 = Naraccistic number
• 24,684,612 = 18 + 28 + 38 + 48 + 58 + 68 + 78 + 88
• 24,883,200 = superfactorial of 6
• 25,502,500 = Sum of the first 100 cubed numbers
• 25,411,681 = 50412 = 714
• 26,873,856 = 51842 = 724
• 27,644,437 = Bell number
• 28,398,241 = 53292 = 734
• 28,629,151 = 315
• 29,986,576 = 54762 = 744

30,000,000 to 39,999,999

• 31,172,165 = Smallest Proth exponent for n = 10223 (see Seventeen or Bust)
• 31,536,000 = Standard number of seconds in a non-leap year (omitting leap seconds)
• 31,622,400 = Standard number of seconds in a leap year (omitting leap seconds)
• 31,640,625 = 56252 = 754
• 33,333,333 = repdigit
• 33,362,176 = 57762 = 764
• 33,445,755 = Keith number
• 33,550,336 = Fifth perfect number
• 33,554,432 = Leyland number using 8 & 8 (88 + 88); 325 = 225, number of directed graphs on 5 labeled nodes
• 33,555,057 = Leyland number using 2 & 25 (225 + 252)
• **33,588,234 ** = Number of 32-bead necklaces (turning over is allowed) where complements are equivalent
• 34,459,425 = Double factorial of 17
• 34,012,224 = 58322 = 3243 = 186
• 34,636,834 = Number of 31-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
• 35,153,041 = 59292 = 774
• 35,357,670 = C(16) = \frac{\binom{2 \times 16}{16}}{16+1} = \frac{(2 \times 16)!}{16! \times (16+1)!}
• 35,831,808 = 127 = 10,000,00012 AKA a dozen-great-great-gross (1012 great-great-grosses)
• 36,614,981 = Alternating factorial
• 36,926,037 = 3333
• 37,015,056 = 60842 = 784
• 37,210,000 = 61002
• 37,259,704 = 3343
• 37,595,375 = 3353
• 37,933,056 = 3363
• 38,440,000 = 62002
• 38,613,965 = Pell number, Markov number
• 38,950,081 = 62412 = 794
• 39,088,169 = Fibonacci number
• 39,135,393 = 335
• 39,299,897 = Number of trees with 24 unlabeled nodes
• 39,690,000 = 63002
• 39,905,269 = Number of square (0,1)-matrices without zero rows and with exactly 8 entries equal to 1
• 39,916,800 = 11!
• 39,916,801 = Factorial prime

40,000,000 to 49,999,999

• 40,140,288 = As Long As Possible total frames
• 40,353,607 = 3433 = 79
• 40,960,000 = 64002 = 804
• 41,602,425 = Number of reduced trees with 34 nodes
• 41,791,750 = The sum of the first 500 squared numbes
• 43,046,721 = 65612 = 814 = 98 = 316
• 43,050,817 = Leyland number using 3 & 16 (316 + 163)
• 43,112,609 = Mersenne prime exponent
• 43,443,858 = Palindromic in 3 consecutive bases: 3C323C315, 296E69216, 1DA2AD117
• 43,484,701 = Markov number
• 44,121,607 = Keith number
• 44,317,196 = Smallest digitally balanced number in base 9
• 44,444,444 = Repdigit
• 45,086,079 = Number of prime numbers having nine digits
• 45,136,576 = Leyland number using 7 & 9 (79 + 97)
• 45,212,176 = 67242 = 824
• 45,435,424 = 345
• 46,026,618 = Wedderburn-Etherington number
• 46,656,000 = 3603
• 46,749,427 = Number of a partially ordered set with 11 unlabeled elements
• 47,045,881 = 68592 = 3613 = 196
• 47,176,870 = Fifth busy beaver number
• 47,326,700 = First number of the first consecutive centuries each consisting wholly of composite numbers
• 47,326,800 = First number of the first century with the same prime pattern (in this case, no primes) as the previous century
• 47,458,321 = 68892 = 834
• 48,024,900 = Square triangular number
• 48,266,466 = Number of prime knots with 18 crossings
• 48,828,125 = 511
• 48,928,105 = Markov number
• 48,989,176 = Leyland number using 5 & 11 (511 + 115)
• 49,787,136 = 70562 = 844

50,000,000 to 59,999,999

• 50,107,909 = Number of free 17-ominoes
• 50,235,931 = Number of signed trees with 15 nodes
• 50,847,534 = Number of primes under 1,000,000,000
• 50,852,019 = Motzkin number
• 52,200,625 = 72252 = 854
• 52,521,875 = 355
• 54,700,816 = 73962 = 864
• 55,555,555 = Repdigit
• 57,048,048 = Fine number
• 57,289,761 = 75692 = 874
• 57,885,161 = Mersenne prime exponent
• 59,969,536 = 77442 = 884

60,000,000 to 69,999,999

• 60,466,176 = 77762 = 365 = 610
• 61,466,176 = Leyland number using 6 & 10 (610 + 106)
• 62,742,241 = 79212 = 894
• 62,748,517 = 137
• 63,245,986 = Fibonacci number, Markov number
• 64,000,000 = 80002 = 4003 = 206 — vigesimal "million" (1 alau in Mayan, 1 poaltzonxiquipilli in Nahuatl)
• 64,066,176 = 365 = 610
• 64,481,201 = 4013
• 64,964,808 = 4023
• 65,108,062 = Number of 33-bead necklaces (turning over is allowed) where complements are equivalent
• 65,421,664 = Negative multiplicative inverse of 40,014 modulo 2,147,483,563
• 65,610,000 = 81002 = 904
• 66,600,049 = Largest minimal prime in base 10
• 66,666,666 = Repdigit
• 67,108,864 = 81922 = 413 = 226, number of primitive polynomials of degree 32 over GF(2)
• 67,109,540 = Leyland number using 2 & 26 (226 + 262)
• 67,110,932 = Number of 32-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
• 67,137,425 = Leyland number using 4 & 13 (413 + 134)
• 67,240,000 = 82002
• 68,041,019 = Number of parallelogram polyominoes with 23 cells.
• 68,574,961 = 82812 = 914
• 68,890,000 = 83002
• 69,273,666 = Number of primitive polynomials of degree 31 over GF(2)
• 69,343,957 = 375

70,000,000 to 79,999,999

• 71,639,296 = 84642 = 924
• 72,546,283 = The smallest prime number preceded and followed by prime gaps of over 100
• 73,939,133 = The largest right-truncatable prime number in decimal
• 74,207,281 = Mersenne prime exponent
• 74,805,201 = 86492 = 934
• 77,232,917 = Mersenne prime exponent
• 77,777,777 = Repdigit
• 78,074,896 = 88362 = 944
• 78,442,645 = Markov number
• 79,235,168 = 385

80,000,000 to 89,999,999

• 81,450,625 = 90252 = 954
• 82,589,933 = Mersenne prime exponent
• 84,440,886 = Number of reduced trees with 35 nodes
• 84,934,656 = 92162 = 964
• 85,766,121 = 92612 = 4413 = 216
• 86,400,000 = hyperfactorial of 5; 11 × 22 × 33 × 44 × 55
• 87,109,376 = 1-automorphic number
• 87,528,384 = 4443
• 87,539,319 = taxicab number
• 88,529,281 = 94092 = 974
• 88,888,888 = Repdigit
• 88,942,644 = 22×33×77

90,000,000 to 99,999,999

• 90,224,199 = 395
• 90,767,360 = Generalized Euler's number
• 92,236,816 = 96042 = 984
• 93,222,358 = Pell number
• 93,554,688 = 2-automorphic number
• 94,109,401 = Square pentagonal number
• 94,418,953 = Markov prime
• 96,059,601 = 98012 = 994
• 96,342,400 = Triple factorial of 23
• 99,897,344 = 4643, the largest 8-digit cube
• 99,980,001 = 99992, the largest 8-digit square
• 99,990,001 = unique prime
• 99,991,011 = Largest triangular number with 8 digits and the 14,141st triangular number
• 99,999,989 = Greatest prime number with 8 digits
• 99,999,999 = Repdigit, Friedman number, believed to be smallest number to be both repdigit and Friedman

References

References

1. {{cite OEIS. A000014. Number of series-reduced trees with n nodes
2. {{cite OEIS. A000060. Number of signed trees with n nodes
3. {{cite OEIS. A002104. Logarithmic numbers
4. {{cite oeis. A002275. Repunits: (10^n - 1)/9. Often denoted by R_n
5. {{cite OEIS. A007629. Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)
6. {{Cite OEIS. A003226. Automorphic numbers
7. {{cite OEIS. A000055. Number of trees with n unlabeled nodes
8. {{cite OEIS. A000045. Fibonacci numbers
9. {{cite OEIS. A000957. Fine's sequence (or Fine numbers): number of relations of valence > 0 on an n-set; also number of ordered rooted trees with n edges having root of even degree
10. "Curium {{!}} Cm (Element) - PubChem".
11. {{cite OEIS. A000129. Pell numbers
12. {{cite OEIS. A000258. Expansion of e.g.f. exp(exp(exp(x)-1)-1)
13. {{cite OEIS. A000011. Number of n-bead necklaces (turning over is allowed) where complements are equivalent
14. {{Cite OEIS. A001923
15. {{cite OEIS. A011260. Number of primitive polynomials of degree n over GF(2)
16. {{cite OEIS. A000013. Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
17. {{cite OEIS. A001006. Motzkin numbers
18. {{cite OEIS. A001190. Wedderburn-Etherington numbers
19. {{cite OEIS. A006785. Number of triangle-free graphs on n vertices
20. {{cite OEIS. A004490. Colossally abundant numbers
21. {{cite OEIS. A002201. Superior highly composite numbers
22. {{cite OEIS. A048102. Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i
23. {{cite OEIS. A031971. Sum_{1..n} k^n
24. {{cite OEIS. A000110. Bell numbers
25. {{cite OEIS. A000396. Perfect numbers
26. {{cite OEIS. A002416. 2^(n^2)
27. {{cite OEIS. A000108. Catalan numbers: (2n)!/(n!(n+1)!)
28. {{cite OEIS. A005165. Alternating factorials
29. {{cite OEIS. A122400. Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1
30. {{cite OEIS. A088054. Factorial primes
31. {{Cite OEIS. A049363
32. {{Cite OEIS. A006879. Number of primes with n digits.
33. {{cite OEIS. A000112. Number of partially ordered sets (posets) with n unlabeled elements
34. {{cite OEIS. A060843. Maximum number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting
35. {{Cite OEIS. A181098. Primefree centuries (i.e., no prime exists between 100n and 100n+99)
36. {{Cite OEIS. A219996. Centuries whose prime pattern is the same as prime pattern in the previous century
37. "Leyland number".
38. {{cite OEIS. A006958. Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused)
39. {{Cite OEIS. A023188
40. {{Cite OEIS. A138058. Prime numbers, isolated from neighboring primes by ± 100 (or more)
41. {{cite OEIS. A011541. Taxicab, taxi-cab or Hardy-Ramanujan numbers
42. {{Cite OEIS. A349264
43. {{Cite OEIS. A030984. 2-automorphic numbers
44. {{cite OEIS. A040017. Unique period primes (no other prime has same period as 1/p) in order (periods are given in A051627)