From Wikipedia, the free encyclopedia
Natural number
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 107 .
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 = 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
[1]
10,321,920 = double factorial of 16
10,556,001 = 32492 = 574
10,600,510 = number of signed trees with 14 nodes
[2]
10,609,137 =
Leyland number
10,976,184 = logarithmic number
[3]
11,111,111 =
repunit
[4]
11,316,496 = 33642 = 584
11,390,625 = 33752 = 2253 = 156
11,405,773 = Leonardo prime
11,436,171 =
Keith number
[5]
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 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
[6]
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
14,776,336 = 38442 = 624
14,828,074 = number of trees with 23 unlabeled nodes
[7]
14,930,352 =
Fibonacci number
[8]
15,485,863 = 1,000,000th prime number
15,548,694 = Fine number
[9]
15,752,961 = 39692 = 634
15,994,428 =
Pell number
[10]
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.
[11]
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
16,797,952 = Leyland number
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
[12]
17,650,828 = 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88
[13]
17,820,000 = number of primitive polynomials of degree 30 over GF(2)
[14]
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
[15]
18,199,284 =
Motzkin number
[16]
18,407,808 = number of primitive polynomials of degree 29 over GF(2)
[14]
18,974,736 = 43562 = 664
19,487,171 = 117
19,680,277 =
Wedderburn-Etherington number
[17]
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
[1]
20,797,002 = number of triangle-free graphs on 13 vertices
[18]
21,381,376 = 46242 = 684
21,531,778 = Markov number
21,621,600 =
colossally abundant number ,
[19]
superior highly composite number
[20]
22,222,222 =
repdigit
22,235,661 = 33 ×77
[21]
22,667,121 = 47612 = 694
24,010,000 = 49002 = 704
24,137,569 = 49132 = 2893 = 176
24,157,817 = Fibonacci number,
[8] Markov number
24,300,000 = 305
24,678,050 = equal to the sum of the eighth powers of its digits
24,684,612 = 18 + 28 + 38 + 48 + 58 + 68 + 78 + 88
[22]
24,883,200 = superfactorial of 6
25,411,681 = 50412 = 714
26,873,856 = 51842 = 724
27,644,437 =
Bell number
[23]
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
[5]
33,550,336 = fifth
perfect number
[24]
33,554,432 = 325 = 225 , Leyland number, number of directed graphs on 5 labeled nodes
[25]
33,555,057 = Leyland number
33,588,234 = number of 32-bead necklaces (turning over is allowed) where complements are equivalent
[12]
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
[15]
35,153,041 = 59292 = 774
35,357,670 =
C
(
16
)
=
(
2
×
16
16
)
16
+
1
=
(
2
×
16
)
!
16
!
×
(
16
+
1
)
!
{\displaystyle C(16)={\frac {\binom {2\times 16}{16}}{16+1}}={\frac {(2\times 16)!}{16!\times (16+1)!}}}
[26]
35,831,808 = 127 = 10,000,00012 AKA a dozen-great-great-gross (1012 great-great-grosses)
36,614,981 =
alternating factorial
[27]
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,
[10] Markov number
38,950,081 = 62412 = 794
39,088,169 = Fibonacci number
[8]
39,135,393 = 335
39,299,897 = number of trees with 24 unlabeled nodes
[28]
39,690,000 = 63002
39,905,269 = number of square (0,1)-matrices without zero rows and with exactly 8 entries equal to 1
[29]
39,916,800 = 11
!
39,916,801 =
factorial prime
[30]
40,000,000 to 49,999,999
40,353,607 = 3433 = 79
40,960,000 = 64002 = 804
41,602,425 = number of reduced trees with 34 nodes
[1]
43,046,721 = 65612 = 814 = 98 = 316
43,050,817 = Leyland number
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
[5]
44,317,196 = smallest digitally balanced number in base 9
[31]
44,444,444 = repdigit
45,086,079 = number of prime numbers having nine digits
[32]
45,136,576 = Leyland number
45,212,176 = 67242 = 824
45,435,424 = 345
46,026,618 = Wedderburn-Etherington number
[17]
46,656,000 = 3603
46,749,427 = number of
partially ordered set with 11 unlabeled elements
[33]
47,045,881 = 68592 = 3613 = 196
47,326,700 = first number of the first consecutive centuries each consisting wholly of
composite numbers
[34]
47,326,800 = first number of the first century with the same prime pattern (in this case, no
primes ) as the previous century
[35]
47,458,321 = 68892 = 834
48,024,900 =
square triangular number
48,828,125 = 511
48,928,105 = Markov number
48,989,176 = Leyland number
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
[36]
50,847,534 = The number of primes under 109
50,852,019 = Motzkin number
[16]
52,200,625 = 72252 = 854
52,521,875 = 355
54,700,816 = 73962 = 864
55,555,555 = repdigit
57,048,048 = Fine number
[9]
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
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,964,808 = 4023
65,108,062 = number of 33-bead necklaces (turning over is allowed) where complements are equivalent
[12]
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)
[14]
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
[15]
67,137,425 = Leyland number
68,041,019 = number of parallelogram polyominoes with 23 cells.
[37]
68,574,961 = 82812 = 914
69,273,666 = number of primitive polynomials of degree 31 over GF(2)
[14]
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
[38]
[39]
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 = The largest known
Mersenne prime exponent, as of 2023
84,440,886 = number of reduced trees with 35 nodes
[1]
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
[6]
87,539,319 =
taxicab number
[40]
88,529,281 = 94092 = 974
88,888,888 = repdigit
88,942,644 = 22 ×33 ×77
[21]
90,000,000 to 99,999,999
90,224,199 = 395
90,767,360 = Generalized
Euler's number
[41]
92,236,816 = 96042 = 984
93,222,358 = Pell number
[10]
93,554,688 = 2-
automorphic number
[42]
94,109,401 = square
pentagonal number
94,418,953 = Markov prime
96,059,601 = 98012 = 994
99,897,344 = 4643 , the largest 8-digit cube
99,980,001 = 99992 , the largest 8-digit square
99,990,001 =
unique prime
[43]
99,991,011 = largest
triangular number with 8 digits and the 14,141st triangular number
99,999,989 = greatest prime number with 8 digits
[44]
99,999,999 = repdigit,
Friedman number , believed to be smallest number to be both repdigit and Friedman
See also
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 A000060 (Number of signed 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.
^
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.
^
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.
^
Sloane, N. J. A. (ed.).
"Sequence A000055 (Number of trees with n unlabeled nodes)" . The
On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^
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.
^
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 A000055 (Number of trees with n unlabeled nodes)" . 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 A049363 (a(1) = 1; for n > 1, smallest digitally balanced number in base n.)" . 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.
^
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.
^
Sloane, N. J. A. (ed.).
"Sequence A000060 (Number of signed trees with n nodes)" . The
On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^
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.
^
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.
^
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 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.
^
Sloane, N. J. A. (ed.).
"Sequence A030984 (2-automorphic numbers)" . The
On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^
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 .
Examples in numerical order Expression methods
Related articles (alphabetical order)
100,000
1,000,000
10,000,000
100,000,000
1,000,000,000