10,000,000

• 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 = 3163², the smallest 8-digit square
• 10,077,696 = 216³ = 6⁹, the smallest 8-digit cube
• 10,172,638 = number of reduced trees with 32 nodes{{cite OEIS|A000014|Number of series-reduced trees with n nodes}}
• 10,321,920 = double factorial of 16
• 10,556,001 = 3249² = 57⁴
• 10,600,510 = number of signed trees with 14 nodes{{cite OEIS|A000060|Number of signed trees with n nodes}}
• 10,609,137 = Leyland number using 6 & 9 (6⁹ + 9⁶)
• 10,976,184 = logarithmic number{{cite OEIS|A002104|Logarithmic numbers}}
• 11,111,111 = repunit{{cite oeis|A002275|Repunits: (10^n - 1)/9. Often denoted by R_n}}
• 11,316,496 = 3364² = 58⁴
• 11,390,625 = 3375² = 225³ = 15⁶
• 11,405,773 = Leonardo prime
• 11,436,171 = Keith number{{cite OEIS|A007629|Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)}}
• 11,485,154 = Markov number
• 11,881,376 = 26⁵
• 11,943,936 = 3456²
• 12,117,361 = 3481² = 59⁴
• 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{{Cite OEIS|A003226|Automorphic numbers}}
• 12,960,000 = 3600² = 60⁴ = (3·4·5)⁴, 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 = 3721² = 61⁴
• 14,348,907 = 243³ = 27⁵ = 3¹⁵
• 14,352,282 = Leyland number = 3¹⁵ + 15³
• 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 = 3844² = 62⁴
• 14,828,074 = number of trees with 23 unlabeled nodes{{cite OEIS|A000055|Number of trees with n unlabeled nodes}}
• 14,930,352 = Fibonacci number{{cite OEIS|A000045|Fibonacci numbers}}
• 15,485,863 = 1,000,000th prime number
• 15,548,694 = Fine number{{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}}
• 15,600,000 = the number of years equal to the half-life of curium-247 (²⁴⁷Cm), the longest-lived isotope of curium{{Cite web |title=Curium {{!}} Cm (Element) - PubChem |url=https://pubchem.ncbi.nlm.nih.gov/element/Curium |access-date=2025-04-22 |website=pubchem.ncbi.nlm.nih.gov}}
• 15,752,961 = 3969² = 63⁴
• 15,994,428 = Pell number{{cite OEIS|A000129|Pell numbers}}
• 16,003,008 = 252³
• 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.{{cite OEIS|A000258|Expansion of e.g.f. exp(exp(exp(x)-1)-1)}}
• 16,777,216 = 4096² = 256³ = 64⁴ = 16⁶ = 8⁸ = 4¹² = 2²⁴ — hexadecimal "million" (0x1000000), number of possible colors in 24/32-bit Truecolor computer graphics
• 16,777,792 = Leyland number = 2²⁴ + 24²
• 16,797,952 = Leyland number = 4¹² + 12⁴
• 16,964,653 = Markov number
• 17,016,602 = index of a prime Woodall number
• 17,210,368 = 28⁵
• 17,334,801 = number of 31-bead necklaces (turning over is allowed) where complements are equivalent{{cite OEIS|A000011|Number of n-bead necklaces (turning over is allowed) where complements are equivalent}}
• 17,650,828 = 1¹ + 2² + 3³ + 4⁴ + 5⁵ + 6⁶ + 7⁷ + 8⁸{{Cite OEIS|A001923|2=a(n) = Sum_{k=1..n} k^k.}}
• 17,820,000 = number of primitive polynomials of degree 30 over GF(2){{cite OEIS|A011260|Number of primitive polynomials of degree n over GF(2)}}
• 17,850,625 = 4225² = 65⁴
• 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{{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}}
• 18,199,284 = Motzkin number{{cite OEIS|A001006|Motzkin numbers}}
• 18,407,808 = number of primitive polynomials of degree 29 over GF(2)
• 18,974,736 = 4356² = 66⁴
• 19,487,171 = 11⁷
• 19,680,277 = Wedderburn-Etherington number{{cite OEIS|A001190|Wedderburn-Etherington numbers}}
• 19,987,816 = palindromic in 3 consecutive bases: 41AAA14₁₃, 2924292₁₄, 1B4C4B1₁₅

• 20,031,170 = Markov number
• 20,151,121 = 4489² = 67⁴
• 20,511,149 = 29⁵
• 20,543,579 = number of reduced trees with 33 nodes
• 20,797,002 = number of triangle-free graphs on 13 vertices{{cite OEIS|A006785|Number of triangle-free graphs on n vertices}}
• 21,381,376 = 4624² = 68⁴
• 21,531,778 = Markov number
• 21,621,600 = 13th colossally abundant number,{{cite OEIS|A004490|Colossally abundant numbers}} 13th superior highly composite number{{cite OEIS|A002201|Superior highly composite numbers}}
• 22,222,222 = repdigit
• 22,235,661 = 3³×7⁷{{cite OEIS|A048102|Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i}}
• 22,667,121 = 4761² = 69⁴
• 24,010,000 = 4900² = 70⁴
• 24,137,569 = 4913² = 289³ = 17⁶
• 24,157,817 = Fibonacci number, Markov number
• 24,300,000 = 30⁵
• 24,678,050 = equal to the sum of the eighth powers of its digits
• 24,684,612 = 1⁸ + 2⁸ + 3⁸ + 4⁸ + 5⁸ + 6⁸ + 7⁸ + 8⁸ {{cite OEIS|A031971|Sum_{1..n} k^n}}
• 24,883,200 = superfactorial of 6
• 25,411,681 = 5041² = 71⁴
• 26,873,856 = 5184² = 72⁴
• 27,644,437 = Bell number{{cite OEIS|A000110|Bell numbers}}
• 28,398,241 = 5329² = 73⁴
• 28,629,151 = 31⁵
• 29,986,576 = 5476² = 74⁴

• 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 = 5625² = 75⁴
• 33,333,333 = repdigit
• 33,362,176 = 5776² = 76⁴
• 33,445,755 = Keith number
• 33,550,336 = fifth perfect number{{cite OEIS|A000396|Perfect numbers}}
• 33,554,432 = Leyland number using 8 & 8 (8⁸ + 8⁸); 32⁵ = 2²⁵, number of directed graphs on 5 labeled nodes{{cite OEIS|A002416|2^(n^2)}}
• 33,555,057 = Leyland number using 2 & 25 (2²⁵ + 25²)
• 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 = 5832² = 324³ = 18⁶
• 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 = 5929² = 77⁴
• 35,357,670 = $C(16)\; =\; \backslash frac\{\backslash binom\{2\; \backslash times\; 16\}\{16\}\}\{16+1\}\; =\; \backslash frac\{(2\; \backslash times\; 16)!\}\{16!\; \backslash times\; (16+1)!\}${{cite OEIS|A000108|Catalan numbers: (2n)!/(n!(n+1)!)}}
• 35,831,808 = 12⁷ = 10,000,000₁₂ AKA a dozen-great-great-gross (10₁₂ great-great-grosses)
• 36,614,981 = alternating factorial{{cite OEIS|A005165|Alternating factorials}}
• 36,926,037 = 333³
• 37,015,056 = 6084² = 78⁴
• 37,210,000 = 6100²
• 37,259,704 = 334³
• 37,595,375 = 335³
• 37,933,056 = 336³
• 38,440,000 = 6200²
• 38,613,965 = Pell number, Markov number
• 38,950,081 = 6241² = 79⁴
• 39,088,169 = Fibonacci number
• 39,135,393 = 33⁵
• 39,299,897 = number of trees with 24 unlabeled nodes
• 39,690,000 = 6300²
• 39,905,269 = number of square (0,1)-matrices without zero rows and with exactly 8 entries equal to 1{{cite OEIS|A122400|Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1}}
• 39,916,800 = 11!
• 39,916,801 = factorial prime{{cite OEIS|A088054|Factorial primes}}

• 40,353,607 = 343³ = 7⁹
• 40,960,000 = 6400² = 80⁴
• 41,602,425 = number of reduced trees with 34 nodes
• 43,046,721 = 6561² = 81⁴ = 9⁸ = 3¹⁶
• 43,050,817 = Leyland number using 3 & 16 (3¹⁶ + 16³)
• 43,112,609 = Mersenne prime exponent
• 43,443,858 = palindromic in 3 consecutive bases: 3C323C3₁₅, 296E692₁₆, 1DA2AD1₁₇
• 43,484,701 = Markov number
• 44,121,607 = Keith number
• 44,317,196 = smallest digitally balanced number in base 9{{Cite OEIS|A049363|2=a(1) = 1; for n > 1, smallest digitally balanced number in base n.}}
• 44,444,444 = repdigit
• 45,086,079 = number of prime numbers having nine digits{{Cite OEIS|A006879|Number of primes with n digits.}}
• 45,136,576 = Leyland number using 7 & 9 (7⁹ + 9⁷)
• 45,212,176 = 6724² = 82⁴
• 45,435,424 = 34⁵
• 46,026,618 = Wedderburn-Etherington number
• 46,656,000 = 360³
• 46,749,427 = number of partially ordered set with 11 unlabeled elements{{cite OEIS|A000112|Number of partially ordered sets (posets) with n unlabeled elements}}
• 47,045,881 = 6859² = 361³ = 19⁶
• 47,176,870 = fifth busy beaver number {{cite OEIS|A060843|Maximum number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting}}
• 47,326,700 = first number of the first consecutive centuries each consisting wholly of composite numbers{{Cite OEIS|A181098|Primefree centuries (i.e., no prime exists between 100*n and 100*n+99)}}
• 47,326,800 = first number of the first century with the same prime pattern (in this case, no primes) as the previous century{{Cite OEIS|A219996|Centuries whose prime pattern is the same as prime pattern in the previous century}}
• 47,458,321 = 6889² = 83⁴
• 48,024,900 = square triangular number
• 48,266,466 = number of prime knots with 18 crossings
• 48,828,125 = 5¹¹
• 48,928,105 = Markov number
• 48,989,176 = Leyland number using 5 & 11 (5¹¹ + 11⁵)
• 49,787,136 = 7056² = 84⁴

• 50,107,909 = number of free 17-ominoes
• 50,235,931 = number of signed trees with 15 nodes
• 50,847,534 = the number of primes under 10⁹
• 50,852,019 = Motzkin number
• 52,200,625 = 7225² = 85⁴
• 52,521,875 = 35⁵
• 54,700,816 = 7396² = 86⁴
• 55,555,555 = repdigit
• 57,048,048 = Fine number
• 57,289,761 = 7569² = 87⁴
• 57,885,161 = Mersenne prime exponent
• 59,969,536 = 7744² = 88⁴

• 60,466,176 = 7776² = 36⁵ = 6¹⁰
• 61,466,176 = Leyland number using 6 & 10 (6¹⁰ + 10⁶)
• 62,742,241 = 7921² = 89⁴
• 62,748,517 = 13⁷
• 63,245,986 = Fibonacci number, Markov number
• 64,000,000 = 8000² = 400³ = 20⁶ — vigesimal "million" (1 alau in Mayan, 1 {{lang|nah|poaltzonxiquipilli}} in Nahuatl)
• 64,964,808 = 402³
• 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 = 8100² = 90⁴
• 66,600,049 = Largest minimal prime in base 10
• 66,666,666 = repdigit
• 67,108,864 = 8192² = 4¹³ = 2²⁶, number of primitive polynomials of degree 32 over GF(2)
• 67,109,540 = Leyland number using 2 & 26 (2²⁶ + 26²)
• 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 (4¹³ + 13⁴)
• 68,041,019 = number of parallelogram polyominoes with 23 cells.{{cite OEIS|A006958|Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused)}}
• 68,574,961 = 8281² = 91⁴
• 69,273,666 = number of primitive polynomials of degree 31 over GF(2)
• 69,343,957 = 37⁵

• 71,639,296 = 8464² = 92⁴
• 72,546,283 = the smallest prime number preceded and followed by prime gaps of over 100{{Cite OEIS|A023188|2=Lonely (or isolated) primes: least prime of distance n from nearest prime (n = 1 or even)}}{{Cite OEIS|A138058|Prime numbers, isolated from neighboring primes by ± 100 (or more)}}
• 73,939,133 = the largest right-truncatable prime number in decimal
• 74,207,281 = Mersenne prime exponent
• 74,805,201 = 8649² = 93⁴
• 77,232,917 = Mersenne prime exponent
• 77,777,777 = repdigit
• 78,074,896 = 8836² = 94⁴
• 78,442,645 = Markov number
• 79,235,168 = 38⁵

• 81,450,625 = 9025² = 95⁴
• 82,589,933 = Mersenne prime exponent
• 84,440,886 = number of reduced trees with 35 nodes
• 84,934,656 = 9216² = 96⁴
• 85,766,121 = 9261² = 441³ = 21⁶
• 86,400,000 = hyperfactorial of 5; 1¹ × 2² × 3³ × 4⁴ × 5⁵
• 87,109,376 = 1-automorphic number
• 87,539,319 = taxicab number{{cite OEIS|A011541|Taxicab, taxi-cab or Hardy-Ramanujan numbers}}
• 88,529,281 = 9409² = 97⁴
• 88,888,888 = repdigit
• 88,942,644 = 2²×3³×7⁷

• 90,224,199 = 39⁵
• 90,767,360 = Generalized Euler's number{{Cite OEIS|A349264|2=Generalized Euler numbers, a(n) = n!*[x^n](sec(4*x)*(sin(4*x) + 1))}}
• 92,236,816 = 9604² = 98⁴
• 93,222,358 = Pell number
• 93,554,688 = 2-automorphic number{{Cite OEIS|A030984|2-automorphic numbers}}
• 94,109,401 = square pentagonal number
• 94,418,953 = Markov prime
• 96,059,601 = 9801² = 99⁴
• 99,897,344 = 464³, the largest 8-digit cube
• 99,980,001 = 9999², the largest 8-digit square
• 99,990,001 = unique prime{{cite OEIS|A040017|Unique period primes (no other prime has same period as 1/p) in order (periods are given in A051627)}}
• 99,991,011 = largest triangular number with 8 digits and the 14,141st triangular number
• 99,999,989 = greatest prime number with 8 digits

{{cite web

| url=http://www.wolframalpha.com/input/?i=greatest+prime+number+with+8+digits

| title=greatest prime number with 8 digits

| publisher=Wolfram Alpha | access-date=June 4, 2014 }}

• 99,999,999 = repdigit, Friedman number, believed to be smallest number to be both repdigit and Friedman

• Hebdometre

{{reflist}}

{{Large numbers}}

{{Integers|10}}

{{DEFAULTSORT:10000000}}

Category:Integers

Category:Large numbers

Category:Powers of ten