View source for 100,000,000

{{redirect|Hundred million|the song by Treble Charger|Hundred Million}}
{{infobox number
| number        = 100000000
| cardinal      = One hundred million
| factorization = 2<sup>8</sup> × 5<sup>8</sup>
| roman         = <span style="border-top:double 3px">C</span>
}}
'''100,000,000''' ('''one hundred million''') is the [[natural number]] following [[10,000,000#90,000,000 to 99,999,999|99,999,999]] and preceding 100,000,001.

In [[scientific notation]], it is written as 10<sup>8</sup>.

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'' ({{Lang-zh| t=億 | s=亿 | p=yì}}) (or {{Lang-zh | c=萬萬 | p=wànwàn}} in ancient texts), ''eok'' ({{lang|ko|억/億}}) and ''oku'' ({{nihongo2|億}}). 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 (number)|100]] and also the [[Square (algebra)|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<ref name="A003617">{{Cite OEIS|A003617|Smallest n-digit prime}}</ref>
* 100,005,153 = smallest [[triangular number]] with 9 digits and the 14,142nd triangular number
* 100,020,001 = 10001<sup>2</sup>, palindromic square
* 100,544,625 = 465<sup>3</sup>, the smallest 9-digit cube
* 102,030,201 = 10101<sup>2</sup>, palindromic square
* 102,334,155 = [[Fibonacci number]]
* 102,400,000 = 40<sup>5</sup>
* 104,060,401 = 10201<sup>2</sup> = 101<sup>4</sup>, palindromic square
* 104,636,890 = number of trees with 25 unlabeled nodes<ref name="auto">{{cite OEIS|A000055|Number of trees with n unlabeled nodes}}</ref>
* 105,413,504 = 14<sup>7</sup>
* 107,890,609 = [[Wedderburn-Etherington number]]<ref name=A001190>{{Cite OEIS|A001190|Wedderburn-Etherington numbers}}</ref>
* 111,111,111 = [[repunit]], square root of 12345678987654321
* 111,111,113 = [[Chen prime]], [[Sophie Germain prime]], [[cousin prime]].
* 113,379,904 = 10648<sup>2</sup> = 484<sup>3</sup> = 22<sup>6</sup>
* 115,856,201 = 41<sup>5</sup>
* 119,481,296 = logarithmic number<ref>{{cite OEIS|A002104|Logarithmic numbers}}</ref>
* 120,528,657 = number of centered hydrocarbons with 27 carbon atoms<ref name=A000022>{{cite OEIS|A000022|Number of centered hydrocarbons with n atoms}}</ref>
* 121,242,121 = 11011<sup>2</sup>, palindromic square
* 122,522,400 = least number <math>m</math> such that <math>\frac{\sigma(m)}{m} > 5</math>, where <math>\sigma(m)</math> = sum of divisors of m<ref>{{cite OEIS|A134716|least number m such that sigma(m)/m > n, where sigma(m) is the sum of divisors of m}}</ref>
* 123,454,321 = 11111<sup>2</sup>, palindromic square
* 123,456,789 = smallest zeroless base 10 [[pandigital number]]
* 125,686,521 = 11211<sup>2</sup>, palindromic square
* 126,390,032 = number of 34-bead necklaces (turning over is allowed) where complements are equivalent<ref name=A000011>{{cite OEIS|A000011|Number of n-bead necklaces (turning over is allowed) where complements are equivalent}}</ref>
* 126,491,971 = Leonardo prime<ref name=A145912>{{Cite OEIS|A145912|Prime Leonardo numbers}}</ref>
* 129,140,163 = 3<sup>17</sup>
* 129,145,076 = [[Leyland number]]<ref name=A076980>{{Cite OEIS|A076980|2=Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1))}}</ref> using 3 & 17 (3<sup>17</sup> + 17<sup>3</sup>)
* 129,644,790 = [[Catalan number]]<ref name=A000108>{{Cite OEIS|A000108|Catalan numbers}}</ref>
* 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<ref name=A000013>{{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}}</ref>
* 130,691,232 = 42<sup>5</sup>
* 134,217,728 = 512<sup>3</sup> = 8<sup>9</sup> = 2<sup>27</sup>
* 134,218,457 = Leyland number using 2 & 27 (2<sup>27</sup> + 27<sup>2</sup>)
* 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<ref name="auto2">{{cite OEIS|A000031|Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n}}</ref>
* 136,048,896 = 11664<sup>2</sup> = 108<sup>4</sup>
* 136,279,841 = The largest known [[Mersenne prime]] exponent, as of October 2024
* 139,854,276 = 11826<sup>2</sup>, the smallest zeroless base 10 pandigital square
* 142,547,559 = [[Motzkin number]]<ref name=A001006>{{Cite OEIS|A001006|Motzkin numbers}}</ref>
* 147,008,443 = 43<sup>5</sup>
* 148,035,889 = 12167<sup>2</sup> = 529<sup>3</sup> = 23<sup>6</sup>
* 157,115,917 – number of parallelogram polyominoes with 24 cells.<ref name=A006958>{{cite OEIS|A006958|Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused)}}</ref>
* 157,351,936 = 12544<sup>2</sup> = 112<sup>4</sup>
* 164,916,224 = 44<sup>5</sup>
* 165,580,141 = [[Fibonacci number]]
* 167,444,795 = [[cyclic number]] in [[Senary|base 6]]
* 170,859,375 = 15<sup>7</sup>
* 171,794,492 = number of reduced trees with 36 nodes<ref name=A000014>{{cite OEIS|A000014|Number of series-reduced trees with n nodes}}</ref>
* 177,264,449 = Leyland number using 8 & 9 (8<sup>9</sup> + 9<sup>8</sup>)
* 178,956,971 = smallest composite [[Wagstaff number]] with prime index
* 179,424,673 = 10,000,000th [[prime number]]
* 184,528,125 = 45<sup>5</sup>
* 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.<ref>{{cite OEIS|A000258|Expansion of e.g.f. exp(exp(exp(x)-1)-1)}}</ref>
* 190,899,322 = [[Bell number]]<ref>{{Cite OEIS|A000110|Bell or exponential numbers}}</ref>
* 191,102,976 = 13824<sup>2</sup> = 576<sup>3</sup> = 24<sup>6</sup>
* 192,622,052 = number of free 18-ominoes
* 193,707,721 = smallest prime factor of 2<sup>67</sup> − 1, a number that Mersenne claimed to be prime
* 199,960,004 = number of surface-points of a tetrahedron with edge-length 9999<ref name=A005893>{{cite OEIS|A005893|Number of points on surface of tetrahedron}}</ref>

===200,000,000 to 299,999,999===
* 200,000,002 = number of surface-points of a tetrahedron with edge-length 10000<ref name=A005893/>
* 205,962,976 = 46<sup>5</sup>
* 210,295,326 = [[oeis:A000957|Fine number]]
* 211,016,256 = number of primitive polynomials of degree 33 over GF(2)<ref name=A011260>{{cite OEIS|A011260|Number of primitive polynomials of degree n over GF(2)}}</ref>
* 212,890,625 = 1-[[automorphic number]]<ref name = automorphic>{{Cite OEIS|A003226|Automorphic numbers}}</ref>
* 214,358,881 = 14641<sup>2</sup> = 121<sup>4</sup> = 11<sup>8</sup>
* 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]]<ref name=A000129>{{Cite OEIS|A000129|Pell numbers}}</ref>
* 225,331,713 = [[self-descriptive number]] in base 9
* 229,345,007 = 47<sup>5</sup>
* 232,792,560 = [[superior highly composite number]];<ref name="auto1">{{Cite OEIS|A002201|Superior highly composite numbers}}</ref> [[colossally abundant number]];<ref name=A004490>{{Cite OEIS|A004490|Colossally abundant numbers}}</ref> 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<ref>{{cite OEIS|A000060|Number of signed trees with n nodes}}</ref>
* 244,140,625 = 15625<sup>2</sup> = 125<sup>3</sup> = 25<sup>6</sup> = 5<sup>12</sup>
* 244,389,457 = [[Leyland number]]<ref name=A076980/> using 5 & 12 (5<sup>12</sup> + 12<sup>5</sup>)
* 244,330,711 = n such that n | (3<sup>n</sup> + 5)<ref name=A277288>{{cite OEIS|A277288|Positive integers n such that n divides (3^n + 5)}}</ref>
* 245,492,244 = number of 35-bead necklaces (turning over is allowed) where complements are equivalent<ref name=A000011/>
* 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<ref name=A000013/>
* 253,450,711 = Wedderburn-Etherington prime<ref name=A001190/>
* 254,803,968 = 48<sup>5</sup>
* 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<ref name="auto2"/>
* 267,914,296 = [[Fibonacci number]]
* 268,435,456 = 16384<sup>2</sup> = 128<sup>4</sup> = 16<sup>7</sup> = 4<sup>14</sup> = 2<sup>28</sup>
* 268,436,240 = Leyland number using 2 & 28 (2<sup>28</sup> + 28<sup>2</sup>)
* 268,473,872 = Leyland number using 4 & 14 (4<sup>14</sup> + 14<sup>4</sup>)
* 272,400,600 = the number of terms of the [[harmonic series (mathematics)|harmonic series]] required to pass 20
* 275,305,224 = the number of [[magic square]]s of order 5, excluding rotations and reflections
* 279,793,450 = number of trees with 26 unlabeled nodes<ref name="auto"/>
* 282,475,249 = 16807<sup>2</sup> = 49<sup>5</sup> = 7<sup>10</sup>
* 292,475,249 = Leyland number using 7 & 10 (7<sup>10</sup> + 10<sup>7</sup>)
* 294,130,458 = number of [[prime knots]] with 19 crossings

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

===400,000,000 to 499,999,999===
* 400,080,004 = 20002<sup>2</sup>, palindromic square
* 400,763,223 = Motzkin number<ref name=A001006/>
* 404,090,404 = 20102<sup>2</sup>, palindromic square
* 404,204,977 = number of prime numbers having ten digits<ref>{{Cite OEIS|A006879|Number of primes with n digits}}</ref>
* 405,071,317 = 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + 4<sup>4</sup> + 5<sup>5</sup> + 6<sup>6</sup> + 7<sup>7</sup> + 8<sup>8</sup> + 9<sup>9</sup>
* 410,338,673 = 17<sup>7</sup>
* 418,195,493 = 53<sup>5</sup>
* 429,981,696 = 20736<sup>2</sup> = 144<sup>4</sup> = 12<sup>8</sup> = 100,000,000<sub>12</sub> AKA a gross-great-great-gross (100<sub>12</sub> great-great-grosses)
* 433,494,437 = [[Fibonacci prime]], Markov prime
* 442,386,619 = [[alternating factorial]]<ref>{{Cite OEIS|A005165|Alternating factorials}}</ref>
* 444,101,658 = number of (unordered, unlabeled) rooted trimmed trees with 27 nodes<ref>{{cite OEIS|A002955|Number of (unordered, unlabeled) rooted trimmed trees with n nodes}}</ref>
* 444,444,444 = [[repdigit]]
* 455,052,511 = number of primes under 10<sup>10</sup>
* 459,165,024 = 54<sup>5</sup>
* 467,871,369 = number of triangle-free graphs on 14 vertices<ref>{{cite OEIS|A006785|Number of triangle-free graphs on n vertices}}</ref>
* 477,353,376 = number of 36-bead necklaces (turning over is allowed) where complements are equivalent<ref name=A000011/>
* 477,638,700 = Catalan number<ref name=A000108/>
* 479,001,599 = [[factorial prime]]<ref>{{Cite OEIS|A088054|Factorial primes}}</ref>
* 479,001,600 = 12!
* 481,890,304 = 21952<sup>2</sup> = 784<sup>3</sup> = 28<sup>6</sup>
* 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<ref name=A000013/>
* 499,999,751 = [[Sophie Germain prime]]

===500,000,000 to 599,999,999===
* 503,284,375 = 55<sup>5</sup>
* 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<ref name="auto2"/>
* 522,808,225 = 22865<sup>2</sup>, palindromic square
* 535,828,591 = Leonardo prime<ref name=A145912/>
* 536,870,911 = third composite [[Mersenne number]] with a prime exponent
* 536,870,912 = 2<sup>29</sup>
* 536,871,753 = [[Leyland number]]<ref name=A076980/> using 2 & 29 (2<sup>29</sup> + 29<sup>2</sup>)
* 542,474,231 = k such that the sum of the squares of the first k primes is divisible by k.<ref>{{cite OEIS|A111441|Numbers k such that the sum of the squares of the first k primes is divisible by k}}</ref>
* 543,339,720 = Pell number<ref name=A000129/>
* 550,731,776 = 56<sup>5</sup>
* 554,999,445 = a [[Kaprekar's routine|Kaprekar constant]] for digit length 9 in base 10
* 555,555,555 = [[repdigit]]
* 574,304,985 = 1<sup>9</sup> + 2<sup>9</sup> + 3<sup>9</sup> + 4<sup>9</sup> + 5<sup>9</sup> + 6<sup>9</sup> + 7<sup>9</sup> + 8<sup>9</sup> + 9<sup>9</sup>{{Hair space}}<ref>{{cite OEIS|A031971|Sum_{1..n} k^n}}</ref>
* 575,023,344 = 14-th derivative of x<sup>x</sup> at x=1<ref>{{cite OEIS|A005727|n-th derivative of x^x at x equals 1. Also called Lehmer-Comtet numbers}}</ref>
* 594,823,321 = 24389<sup>2</sup> = 841<sup>3</sup> = 29<sup>6</sup>
* 596,572,387 = Wedderburn-Etherington prime<ref name=A001190/>

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

===700,000,000 to 799,999,999===
* 701,408,733 = [[Fibonacci number]]
* 714,924,299 = 59<sup>5</sup>
* 715,497,037 = number of reduced trees with 38 nodes<ref name=A000014/>
* 715,827,883 = [[Wagstaff prime]],<ref>{{Cite OEIS|A000979|Wagstaff primes}}</ref> Jacobsthal prime
* 725,594,112 = number of primitive polynomials of degree 36 over GF(2)<ref name=A011260/>
* 729,000,000 = 27000<sup>2</sup> = 900<sup>3</sup> = 30<sup>6</sup>
* 742,624,232 = number of free 19-ominoes
* 751,065,460 = number of trees with 27 unlabeled nodes<ref name="auto"/>
* 774,840,978 = [[Leyland number]]<ref name=A076980/> using 9 & 9 (9<sup>9</sup> + 9<sup>9</sup>)
* 777,600,000 = 60<sup>5</sup>
* 777,777,777 = [[repdigit]]
* 778,483,932 = [[oeis:A000957|Fine number]]
* 780,291,637 = Markov prime
* 787,109,376 = 1-[[automorphic number]]<ref name = automorphic/>
* 797,790,928 = number of centered hydrocarbons with 29 carbon atoms<ref name=A000022/>

===800,000,000 to 899,999,999===
* 810,810,000 = smallest number with exactly 1000 factors
* 815,730,721 = 13<sup>8</sup>
* 815,730,721 = 169<sup>4</sup>
* 835,210,000 = 170<sup>4</sup>
* 837,759,792 – number of parallelogram polyominoes with 26 cells.<ref name=A006958/>
* 844,596,301 = 61<sup>5</sup>
* 855,036,081 = 171<sup>4</sup>
* 875,213,056 = 172<sup>4</sup>
* 887,503,681 = 31<sup>6</sup>
* 888,888,888 – [[repdigit]]
* 893,554,688 = 2-[[automorphic number]]<ref>{{Cite OEIS|A030984|2-automorphic numbers}}</ref>
* 893,871,739 = 19<sup>7</sup>
* 895,745,041 = 173<sup>4</sup>

===900,000,000 to 999,999,999===
* 906,150,257 = smallest counterexample to the [[Polya conjecture]]
* 916,132,832 = 62<sup>5</sup>
* 923,187,456 = 30384<sup>2</sup>, the largest zeroless pandigital square
* 928,772,650 = number of 37-bead necklaces (turning over is allowed) where complements are equivalent<ref name=A000011/>
* 929,275,200 = number of primitive polynomials of degree 35 over GF(2)<ref name=A011260/>
* 942,060,249 = 30693<sup>2</sup>, 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<ref name="auto2"/>
* 987,654,321 = largest zeroless pandigital number
* 992,436,543 = 63<sup>5</sup>
* 997,002,999 = 999<sup>3</sup>, the largest 9-digit cube
* 999,950,884 = 31622<sup>2</sup>, 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]]

==References==
{{Reflist}}

{{Large numbers}}
{{Integers|10}}

{{DEFAULTSORT:100000000}}
[[Category:Integers]]
[[Category:Large numbers]]
[[Category:Powers of ten]]