Misplaced Pages

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	${\displaystyle {\stackrel {\alpha }{\mathrm {M} }}}$
Roman numeral	X
Greek prefix	hebdo-
Binary	1001100010010110100000002
Ternary	2002110011021013
Senary	5542001446
Octal	461132008
Duodecimal	342305412
Hexadecimal	98968016

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
• 10,321,920 = double factorial of 16
• 10,556,001 = 3249 = 57
• 10,600,510 = number of signed trees with 14 nodes
• 10,609,137 = Leyland number using 6 & 9 (6 + 9)
• 10,976,184 = logarithmic number
• 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
• 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
• 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
• 14,930,352 = Fibonacci number
• 15,485,863 = 1,000,000th prime number
• 15,548,694 = Fine number
• 15,752,961 = 3969 = 63
• 15,994,428 = Pell number
• 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.
• 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
• 17,650,828 = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8
• 17,820,000 = number of primitive polynomials of degree 30 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
• 18,199,284 = Motzkin number
• 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
• 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
• 20,797,002 = number of triangle-free graphs on 13 vertices
• 21,381,376 = 4624 = 68
• 21,531,778 = Markov number
• 21,621,600 = 13th colossally abundant number, 13th superior highly composite number
• 22,222,222 = repdigit
• 22,235,661 = 3×7
• 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
• 24,883,200 = superfactorial of 6
• 25,411,681 = 5041 = 71
• 26,873,856 = 5184 = 72
• 27,644,437 = Bell number
• 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
• 33,550,336 = fifth perfect number
• 33,554,432 = Leyland number using 8 & 8 (8 + 8); 32 = 2, number of directed graphs on 5 labeled nodes
• 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 = ${\displaystyle C(16)={\frac {\binom {2\times 16}{16}}{16+1}}={\frac {(2\times 16)!}{16!\times (16+1)!}}}$
• 35,831,808 = 12 = 10,000,000₁₂ AKA a dozen-great-great-gross (10₁₂ great-great-grosses)
• 36,614,981 = alternating factorial
• 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
• 39,916,800 = 11!
• 39,916,801 = factorial prime

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
• 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
• 44,444,444 = repdigit
• 45,086,079 = number of prime numbers having nine 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
• 47,045,881 = 6859 = 361 = 19
• 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 = 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,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 = 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,000,000 to 69,999,999

• 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 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.
• 68,574,961 = 8281 = 91
• 69,273,666 = number of primitive polynomials of degree 31 over GF(2)
• 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
• 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

80,000,000 to 89,999,999

• 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
• 88,529,281 = 9409 = 97
• 88,888,888 = repdigit
• 88,942,644 = 2×3×7

90,000,000 to 99,999,999

• 90,224,199 = 39
• 90,767,360 = Generalized Euler's number
• 92,236,816 = 9604 = 98
• 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 = 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
• 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

See also

• Hebdometre

References

1. ^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
2. ^ Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
3. Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
4. Sloane, N. J. A. (ed.). "Sequence A002275 (Repunits: (10^n - 1)/9. Often denoted by R_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
5. ^ 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.
6. ^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
7. ^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
8. ^ Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
9. ^ 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.
10. ^ Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
11. 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.
12. ^ 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.
13. Sloane, N. J. A. (ed.). "Sequence A001923 (a(n) = Sum_{k=1..n} k^k.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
14. ^ 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.
15. ^ 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.
16. ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
17. ^ Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
18. Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
19. Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
20. Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
21. ^ 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.
22. Sloane, N. J. A. (ed.). "Sequence A031971 (Sum_{1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
23. Sloane, N. J. A. (ed.). "Sequence A000110 (Bell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
24. Sloane, N. J. A. (ed.). "Sequence A000396 (Perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
25. Sloane, N. J. A. (ed.). "Sequence A002416 (2^(n^2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
26. Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers: (2n)!/(n!(n+1)!))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
27. Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
28. 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.
29. Sloane, N. J. A. (ed.). "Sequence A088054 (Factorial primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
30. Sloane, N. J. A. (ed.). "Sequence A049363 (a(1) = 1; for n > 1, smallest digitally balanced number in base n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
31. Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
32. 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.
33. Sloane, N. J. A. (ed.). "Sequence A060843 (Maximum number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
34. 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.
35. 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.
36. 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.
37. 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.
38. 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.
39. Sloane, N. J. A. (ed.). "Sequence A011541 (Taxicab, taxi-cab or Hardy-Ramanujan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
40. Sloane, N. J. A. (ed.). "Sequence A349264 (Generalized Euler numbers, a(n) = n!*[x^n](sec(4*x)*(sin(4*x) + 1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
41. Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
42. 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.
43. "greatest prime number with 8 digits". Wolfram Alpha. Retrieved June 4, 2014.

• Integers
• Large numbers
• Powers of ten