# 100,000,000

100,000,000 (one hundred million) is the natural number following 99,999,999 and preceding 100,000,001.
In scientific notation, it is written as 10$^8$.
East Asian languages treat 100,000,000 as a counting unit, significant as the square of a myriad, also a counting unit. In Chinese, Korean, and Japanese respectively it is yi (simplified Chinese: 亿; traditional Chinese: 億; pinyin: yì) (or Chinese: 萬萬; pinyin: wànwàn in ancient texts), eok (억/億) and oku (億). These languages do not have single words for a thousand to the second, third, fifth powers, etc.
100,000,000 is also the fourth power of 100 and also the square of 10000.

## Selected 9-digit numbers (100,000,001–999,999,999)
### 100,000,001 to 199,999,999

* 100,000,007 = smallest nine digit prime
* 100,005,153 = smallest triangular number with 9 digits and the 14,142nd triangular number
* 100,020,001 = 10001$^2$, palindromic square
* 100,544,625 = 465$^3$, the smallest 9-digit cube
* 102,030,201 = 10101$^2$, palindromic square
* 102,334,155 = Fibonacci number
* 102,400,000 = 40$^5$
* 104,060,401 = 10201$^2$ = 101$^4$, palindromic square
* 104,636,890 = number of trees with 25 unlabeled nodes
* 105,413,504 = 14$^7$
* 107,890,609 = Wedderburn-Etherington number
* 111,111,111 = repunit, square root of 12345678987654321
* 111,111,113 = Chen prime, Sophie Germain prime, cousin prime.
* 113,379,904 = 10648$^2$ = 484$^3$ = 22$^6$
* 115,856,201 = 41$^5$
* 119,481,296 = logarithmic number
* 120,528,657 = number of centered hydrocarbons with 27 carbon atoms
* 121,242,121 = 11011$^2$, palindromic square
* 122,522,400 = least number $m$ such that ${\frac {\sigma (m)}{m}}>5$, where $\sigma (m)$ = sum of divisors of m
* 123,454,321 = 11111$^2$, palindromic square
* 123,456,789 = smallest zeroless base 10 pandigital number
* 125,686,521 = 11211$^2$, palindromic square
* 126,390,032 = number of 34-bead necklaces (turning over is allowed) where complements are equivalent
* 126,491,971 = Leonardo prime
* 129,140,163 = 3$^{17}$
* 129,145,076 = Leyland number using 3 & 17 (3$^{17}$ + 17$^3$)
* 129,644,790 = Catalan number
* 130,150,588 = number of 33-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
* 130,691,232 = 42$^5$
* 134,217,728 = 512$^3$ = 8$^9$ = 2$^{27}$
* 134,218,457 = Leyland number using 2 & 27 (2$^{27}$ + 27$^2$)
* 134,219,796 = number of 32-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 32-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 32
* 136,048,896 = 11664$^2$ = 108$^4$
* 136,279,841 = The largest known Mersenne prime exponent, as of October 2024
* 139,854,276 = 11826$^2$, the smallest zeroless base 10 pandigital square
* 142,547,559 = Motzkin number
* 147,008,443 = 43$^5$
* 148,035,889 = 12167$^2$ = 529$^3$ = 23$^6$
* 157,115,917 – number of parallelogram polyominoes with 24 cells.
* 157,351,936 = 12544$^2$ = 112$^4$
* 164,916,224 = 44$^5$
* 165,580,141 = Fibonacci number
* 167,444,795 = cyclic number in base 6
* 170,859,375 = 15$^7$
* 171,794,492 = number of reduced trees with 36 nodes
* 177,264,449 = Leyland number using 8 & 9 (8$^9$ + 9$^8$)
* 178,956,971 = smallest composite Wagstaff number with prime index
* 179,424,673 = 10,000,000th prime number
* 184,528,125 = 45$^5$
* 185,794,560 = double factorial of 18
* 188,378,402 = number of ways to partition {1,2,...,11} and then partition each cell (block) into subcells.
* 190,899,322 = Bell number
* 191,102,976 = 13824$^2$ = 576$^3$ = 24$^6$
* 192,622,052 = number of free 18-ominoes
* 193,707,721 = smallest prime factor of 2$^{67}$ − 1, a number that Mersenne claimed to be prime
* 199,960,004 = number of surface-points of a tetrahedron with edge-length 9999

### 200,000,000 to 299,999,999

* 200,000,002 = number of surface-points of a tetrahedron with edge-length 10000
* 205,962,976 = 46$^5$
* 210,295,326 = Fine number
* 211,016,256 = number of primitive polynomials of degree 33 over GF(2)
* 212,890,625 = 1-automorphic number
* 214,358,881 = 14641$^2$ = 121$^4$ = 11$^8$
* 222,222,222 = repdigit
* 222,222,227 = safe prime
* 223,092,870 = the product of the first nine prime numbers, thus the ninth primorial
* 225,058,681 = Pell number
* 225,331,713 = self-descriptive number in base 9
* 229,345,007 = 47$^5$
* 232,792,560 = superior highly composite number; colossally abundant number; smallest number divisible by the numbers from 1 to 22 (there is no smaller number divisible by the numbers from 1 to 20 since any number divisible by 3 and 7 must be divisible by 21 and any number divisible by 2 and 11 must be divisible by 22)
* 240,882,152 = number of signed trees with 16 nodes
* 244,140,625 = 15625$^2$ = 125$^3$ = 25$^6$ = 5$^{12}$
* 244,389,457 = Leyland number using 5 & 12 (5$^{12}$ + 12$^5$)
* 244,330,711 = n such that n | (3$^n$ + 5)
* 245,492,244 = number of 35-bead necklaces (turning over is allowed) where complements are equivalent
* 252,648,992 = number of 34-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
* 253,450,711 = Wedderburn-Etherington prime
* 254,803,968 = 48$^5$
* 260,301,176 = number of 33-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 33-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 33
* 267,914,296 = Fibonacci number
* 268,435,456 = 16384$^2$ = 128$^4$ = 16$^7$ = 4$^{14}$ = 2$^{28}$
* 268,436,240 = Leyland number using 2 & 28 (2$^{28}$ + 28$^2$)
* 268,473,872 = Leyland number using 4 & 14 (4$^{14}$ + 14$^4$)
* 272,400,600 = the number of terms of the harmonic series required to pass 20
* 275,305,224 = the number of magic squares of order 5, excluding rotations and reflections
* 279,793,450 = number of trees with 26 unlabeled nodes
* 282,475,249 = 16807$^2$ = 49$^5$ = 7$^{10}$
* 292,475,249 = Leyland number using 7 & 10 (7$^{10}$ + 10$^7$)
* 294,130,458 = number of prime knots with 19 crossings

### 300,000,000 to 399,999,999

* 308,915,776 = 17576$^2$ = 676$^3$ = 26$^6$
* 309,576,725 = number of centered hydrocarbons with 28 carbon atoms
* 312,500,000 = 50$^5$
* 321,534,781 = Markov prime
* 331,160,281 = Leonardo prime
* 333,333,333 = repdigit
* 336,849,900 = number of primitive polynomials of degree 34 over GF(2)
* 345,025,251 = 51$^5$
* 350,238,175 = number of reduced trees with 37 nodes
* 362,802,072 – number of parallelogram polyominoes with 25 cells
* 364,568,617 = Leyland number using 6 & 11 (6$^{11}$ + 11$^6$)
* 365,496,202 = n such that n | (3$^n$ + 5)
* 367,567,200 = 14th colossally abundant number, 14th superior highly composite number
* 380,204,032 = 52$^5$
* 381,654,729 = the only polydivisible number that is also a zeroless pandigital number
* 387,420,489 = 19683$^2$ = 729$^3$ = 27$^6$ = 9$^9$ = 3$^{18}$ and in tetration notation $^2$9
* 387,426,321 = Leyland number using 3 & 18 (3$^{18}$ + 18$^3$)

### 400,000,000 to 499,999,999

* 400,080,004 = 20002$^2$, palindromic square
* 400,763,223 = Motzkin number
* 404,090,404 = 20102$^2$, palindromic square
* 404,204,977 = number of prime numbers having ten digits
* 405,071,317 = 1$^1$ + 2$^2$ + 3$^3$ + 4$^4$ + 5$^5$ + 6$^6$ + 7$^7$ + 8$^8$ + 9$^9$
* 410,338,673 = 17$^7$
* 418,195,493 = 53$^5$
* 429,981,696 = 20736$^2$ = 144$^4$ = 12$^8$ = 100,000,000$_{12}$ AKA a gross-great-great-gross (100$_{12}$ great-great-grosses)
* 433,494,437 = Fibonacci prime, Markov prime
* 442,386,619 = alternating factorial
* 444,101,658 = number of (unordered, unlabeled) rooted trimmed trees with 27 nodes
* 444,444,444 = repdigit
* 455,052,511 = number of primes under 10$^{10}$
* 459,165,024 = 54$^5$
* 467,871,369 = number of triangle-free graphs on 14 vertices
* 477,353,376 = number of 36-bead necklaces (turning over is allowed) where complements are equivalent
* 477,638,700 = Catalan number
* 479,001,599 = factorial prime
* 479,001,600 = 12!
* 481,890,304 = 21952$^2$ = 784$^3$ = 28$^6$
* 490,853,416 = number of 35-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
* 499,999,751 = Sophie Germain prime

### 500,000,000 to 599,999,999

* 503,284,375 = 55$^5$
* 505,294,128 = number of 34-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 34-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 34
* 522,808,225 = 22865$^2$, palindromic square
* 535,828,591 = Leonardo prime
* 536,870,911 = third composite Mersenne number with a prime exponent
* 536,870,912 = 2$^{29}$
* 536,871,753 = Leyland number using 2 & 29 (2$^{29}$ + 29$^2$)
* 542,474,231 = k such that the sum of the squares of the first k primes is divisible by k.
* 543,339,720 = Pell number
* 550,731,776 = 56$^5$
* 554,999,445 = a Kaprekar constant for digit length 9 in base 10
* 555,555,555 = repdigit
* 574,304,985 = 1$^9$ + 2$^9$ + 3$^9$ + 4$^9$ + 5$^9$ + 6$^9$ + 7$^9$ + 8$^9$ + 9$^9$
* 575,023,344 = 14-th derivative of x$^x$ at x=1
* 594,823,321 = 24389$^2$ = 841$^3$ = 29$^6$
* 596,572,387 = Wedderburn-Etherington prime

### 600,000,000 to 699,999,999

* 601,692,057 = 57$^5$
* 612,220,032 = 18$^7$
* 617,323,716 = 24846$^2$, palindromic square
* 635,318,657 = the smallest number that is the sum of two fourth powers in two different ways (59$^4$ + 158$^4$ = 133$^4$ + 134$^4$), of which Euler was aware.
* 644,972,544 = 864$^3$, 3-smooth number
* 648,646,704 = φ(10$^9$−1), where φ is the Euler's totient function
* 654,729,075 = double factorial of 19
* 656,356,768 = 58$^5$
* 666,666,666 = repdigit
* 670,617,279 = highest stopping time integer under 10$^9$ for the Collatz conjecture

### 700,000,000 to 799,999,999

* 701,408,733 = Fibonacci number
* 714,924,299 = 59$^5$
* 715,497,037 = number of reduced trees with 38 nodes
* 715,827,883 = Wagstaff prime, Jacobsthal prime
* 725,594,112 = number of primitive polynomials of degree 36 over GF(2)
* 729,000,000 = 27000$^2$ = 900$^3$ = 30$^6$
* 742,624,232 = number of free 19-ominoes
* 751,065,460 = number of trees with 27 unlabeled nodes
* 774,840,978 = Leyland number using 9 & 9 (9$^9$ + 9$^9$)
* 777,600,000 = 60$^5$
* 777,777,777 = repdigit
* 778,483,932 = Fine number
* 780,291,637 = Markov prime
* 787,109,376 = 1-automorphic number
* 797,790,928 = number of centered hydrocarbons with 29 carbon atoms

### 800,000,000 to 899,999,999

* 810,810,000 = smallest number with exactly 1000 factors
* 815,730,721 = 13$^8$
* 815,730,721 = 169$^4$
* 835,210,000 = 170$^4$
* 837,759,792 – number of parallelogram polyominoes with 26 cells.
* 844,596,301 = 61$^5$
* 855,036,081 = 171$^4$
* 875,213,056 = 172$^4$
* 887,503,681 = 31$^6$
* 888,888,888 – repdigit
* 893,554,688 = 2-automorphic number
* 893,871,739 = 19$^7$
* 895,745,041 = 173$^4$

### 900,000,000 to 999,999,999

* 906,150,257 = smallest counterexample to the Polya conjecture
* 916,132,832 = 62$^5$
* 923,187,456 = 30384$^2$, the largest zeroless pandigital square
* 928,772,650 = number of 37-bead necklaces (turning over is allowed) where complements are equivalent
* 929,275,200 = number of primitive polynomials of degree 35 over GF(2)
* 942,060,249 = 30693$^2$, palindromic square
* 981,706,832 = number of 35-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 35-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 35
* 987,654,321 = largest zeroless pandigital number
* 992,436,543 = 63$^5$
* 997,002,999 = 999$^3$, the largest 9-digit cube
* 999,950,884 = 31622$^2$, the largest 9-digit square
* 999,961,560 = largest triangular number with 9 digits and the 44,720th triangular number
* 999,999,937 = largest 9-digit prime number
* 999,999,999 = repdigit