10000000
List of numbers Integers ← 10⁰ 10¹ 10² 10³ 10⁴ 10⁵ 10⁶ 10⁷ 10⁸ 10⁹
Cardinal	Ten million
Ordinal	10000000th (ten millionth)
Factorization	2⁷ · 5⁷
Greek numeral	${\stackrel {\alpha }{\mathrm {M} ))$
Roman numeral	X
Greek prefix	hebdo-
Binary	100110001001011010000000₂
Ternary	200211001102101₃
Senary	554200144₆
Octal	46113200₈
Duodecimal	3423054₁₂
Hexadecimal	989680₁₆

10,000,000 (ten million) is the natural number following 9,999,999 and preceding 10,000,001.

In scientific notation, it is written as 10⁷.

In South Asia except for Sri Lanka, it is known as the crore.

In Cyrillic numerals, it is known as the vran (вран — raven).

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 = 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^[1]
10,321,920 = double factorial of 16
10,556,001 = 3249² = 57⁴
10,609,137 = Leyland number
10,976,184 = logarithmic number^[2]
11,111,111 = repunit
11,316,496 = 3364² = 58⁴
11,390,625 = 3375² = 225³ = 15⁶
11,405,773 = Leonardo prime
11,436,171 = Keith number^[3]
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 all the numbers 1 through 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^[4]
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
14,776,336 = 3844² = 62⁴
14,930,352 = Fibonacci number^[5]
15,485,863 = 1,000,000th prime number
15,548,694 = Fine number^[6]
15,752,961 = 3969² = 63⁴
15,994,428 = Pell number^[7]
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 subcells.^[8]
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
16,797,952 = Leyland number
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^[9]
17,650,828 = 1¹ + 2² + 3³ + 4⁴ + 5⁵ + 6⁶ + 7⁷ + 8⁸^[10]
17,820,000 = number of primitive polynomials of degree 30 over GF(2)^[11]
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^[12]
18,199,284 = Motzkin number^[13]
18,407,808 = number of primitive polynomials of degree 29 over GF(2)^[11]
18,974,736 = 4356² = 66⁴
19,487,171 = 11⁷
19,680,277 = Wedderburn-Etherington number^[14]
19,987,816 = palindromic in 3 consecutive bases: 41AAA14₁₃, 2924292₁₄, 1B4C4B1₁₅

20,000,000 to 29,999,999

20,031,170 = Markov number
20,151,121 = 4489² = 67⁴
20,511,149 = 29⁵
20,543,579 = number of reduced trees with 33 nodes^[1]
20,797,002 = number of triangle-free graphs on 13 vertices^[15]
21,381,376 = 4624² = 68⁴
21,531,778 = Markov number
21,621,600 = colossally abundant number,^[16] superior highly composite number^[17]
22,222,222 = repdigit
22,235,661 = 3³×7⁷^[18]
22,667,121 = 4761² = 69⁴
24,010,000 = 4900² = 70⁴
24,137,569 = 4913² = 289³ = 17⁶
24,157,817 = Fibonacci number,^[5] 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⁸ ^[19]
24,883,200 = superfactorial of 6
25,411,681 = 5041² = 71⁴
26,873,856 = 5184² = 72⁴
27,644,437 = Bell number^[20]
28,398,241 = 5329² = 73⁴
28,629,151 = 31⁵
29,986,576 = 5476² = 74⁴

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 = 5625² = 75⁴
33,333,333 = repdigit
33,362,176 = 5776² = 76⁴
33,445,755 = Keith number^[3]
33,550,336 = fifth perfect number^[21]
33,554,432 = 32⁵ = 2²⁵, Leyland number, number of directed graphs on 5 labeled nodes^[22]
33,555,057 = Leyland number
33,588,234 = number of 32-bead necklaces (turning over is allowed) where complements are equivalent^[9]
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^[12]
35,153,041 = 5929² = 77⁴
35,357,670 = $C(16)={\frac {\binom {2\times 16}{16)){16+1))={\frac {(2\times 16)!}{16!\times (16+1)!))$ ^[23]
35,831,808 = 12⁷ = 10,000,000₁₂ AKA a dozen-great-great-gross (10₁₂ great-great-grosses)
36,614,981 = alternating factorial^[24]
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,^[7] Markov number
38,950,081 = 6241² = 79⁴
39,088,169 = Fibonacci number^[5]
39,135,393 = 33⁵
39,690,000 = 6300²
39,905,269 = number of square (0,1)-matrices without zero rows and with exactly 8 entries equal to 1^[25]
39,916,800 = 11!
39,916,801 = factorial prime^[26]

40,000,000 to 49,999,999

40,353,607 = 343³ = 7⁹
40,960,000 = 6400² = 80⁴
41,602,425 = number of reduced trees with 34 nodes^[1]
43,046,721 = 6561² = 81⁴ = 9⁸ = 3¹⁶
43,050,817 = Leyland number
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^[3]
44,444,444 = repdigit
45,086,079 = number of prime numbers having nine digits^[27]
45,136,576 = Leyland number
45,212,176 = 6724² = 82⁴
45,435,424 = 34⁵
46,026,618 = Wedderburn-Etherington number^[14]
46,656,000 = 360³
46,749,427 = number of partially ordered set with 11 unlabeled elements^[28]
47,045,881 = 6859² = 361³ = 19⁶
47,326,700 = first number of the first consecutive centuries each consisting wholly of composite numbers^[29]
47,326,800 = first number of the first century with the same prime pattern (in this case, no primes) as the previous century^[30]
47,458,321 = 6889² = 83⁴
48,024,900 = square triangular number
48,828,125 = 5¹¹
48,928,105 = Markov number
48,989,176 = Leyland number
49,787,136 = 7056² = 84⁴

50,000,000 to 59,999,999

50,107,909 = number of free 17-ominoes
50,847,534 = The number of primes under 10⁹
50,852,019 = Motzkin number^[13]
52,200,625 = 7225² = 85⁴
52,521,875 = 35⁵
54,700,816 = 7396² = 86⁴
55,555,555 = repdigit
57,048,048 = Fine number^[6]
57,289,761 = 7569² = 87⁴
57,885,161 = Mersenne prime exponent
59,969,536 = 7744² = 88⁴

60,000,000 to 69,999,999

60,466,176 = 7776² = 36⁵ = 6¹⁰
61,466,176 = Leyland number
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 poaltzonxiquipilli in Nahuatl)
65,108,062 = number of 33-bead necklaces (turning over is allowed) where complements are equivalent^[9]
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)^[11]
67,109,540 = Leyland number
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^[12]
67,137,425 = Leyland number
68,041,019 = number of parallelogram polyominoes with 23 cells.^[31]
68,574,961 = 8281² = 91⁴
69,273,666 = number of primitive polynomials of degree 31 over GF(2)^[11]
69,343,957 = 37⁵

70,000,000 to 79,999,999

71,639,296 = 8464² = 92⁴
72,546,283 = the smallest prime number preceded and followed by prime gaps of over 100^[32]^[33]
73,939,133 = the largest prime number that can be 'tailed' again and again by removing its last digit to produce only primes
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⁵

80,000,000 to 89,999,999

81,450,625 = 9025² = 95⁴
82,589,933 = The largest known Mersenne prime exponent, as of 2023
84,440,886 = number of reduced trees with 35 nodes^[1]
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^[4]
87,539,319 = taxicab number^[34]
88,529,281 = 9409² = 97⁴
88,888,888 = repdigit
88,942,644 = 2²×3³×7⁷^[18]

90,000,000 to 99,999,999

90,224,199 = 39⁵
92,236,816 = 9604² = 98⁴
93,222,358 = Pell number^[7]
93,554,688 = 2-automorphic number^[35]
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^[36]
99,991,011 = largest triangular number with 8 digits and the 14,141st triangular number
99,999,989 = greatest prime number with 8 digits^[37]
99,999,999 = repdigit, Friedman number, believed to be smallest number to be both repdigit and Friedman

References

^ ^a ^b ^c ^d Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-04-06.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-01.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001923 (a(n) = Sum_{k=1..n} k^k.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c ^d Sloane, N. J. A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A048102 (Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A031971 (Sum_{1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000396 (Perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002416 (2^(n^2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers: (2n)!/(n!(n+1)!))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A088054 (Factorial primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000112 (Number of partially ordered sets (posets) with n unlabeled elements)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A181098 (Primefree centuries (i.e., no prime exists between 100*n and 100*n+99))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-09-30.
^ Sloane, N. J. A. (ed.). "Sequence A219996 (Centuries whose prime pattern is the same as prime pattern in the previous century)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-09-30.
^ Sloane, N. J. A. (ed.). "Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A023188 (Lonely (or isolated) primes: least prime of distance n from nearest prime (n = 1 or even).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-01-27.
^ Sloane, N. J. A. (ed.). "Sequence A138058 (Prime numbers, isolated from neighboring primes by ± 100 (or more).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-07-03.
^ Sloane, N. J. A. (ed.). "Sequence A011541 (Taxicab, taxi-cab or Hardy-Ramanujan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-09-01.
^ Sloane, N. J. A. (ed.). "Sequence A040017 (Unique period primes (no other prime has same period as 1/p) in order (periods are given in A051627))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ "greatest prime number with 8 digits". Wolfram Alpha. Retrieved June 4, 2014.

Large numbers

Examples
in
numerical
order

Expression
methods

Notations	Scientific notation Knuth's up-arrow notation Conway chained arrow notation Steinhaus–Moser notation
Operators	Hyperoperation Tetration Pentation Ackermann function Grzegorczyk hierarchy Fast-growing hierarchy