100,000,000


100,000,000 is the natural number following 99,999,999 and preceding 100,000,001.
In scientific notation, it is written as 108.
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, 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 prime100,005,153 = smallest triangular number with 9 digits and the 14,142nd triangular number100,020,001 = 100012, palindromic square100,544,625 = 4653, the smallest 9-digit cube102,030,201 = 101012, palindromic square102,334,155 = Fibonacci number102,400,000 = 405104,060,401 = 102012 = 1014, palindromic square104,636,890 = number of trees with 25 unlabeled nodes105,413,504 = 147107,890,609 = Wedderburn-Etherington number111,111,111 = repunit, square root of 12345678987654321111,111,113 = Chen prime, Sophie Germain prime, cousin prime.113,379,904 = 106482 = 4843 = 226115,856,201 = 415119,481,296 = logarithmic number120,528,657 = number of centered hydrocarbons with 27 carbon atoms121,242,121 = 110112, palindromic square122,522,400 = least number such that, where = sum of divisors of m123,454,321 = 111112, palindromic square123,456,789 = smallest zeroless base-10 pandigital number125,686,521 = 112112, palindromic square126,390,032 = number of 34-bead necklaces where complements are equivalent126,491,971 = Leonardo prime129,140,163 = 317129,145,076 = Leyland number using 3 & 17 129,644,790 = Catalan number130,150,588 = number of 33-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed130,691,232 = 425134,217,728 = 5123 = 89 = 227134,218,457 = Leyland number using 2 & 27 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 32136,048,896 = 116642 = 1084136,279,841 = The largest known Mersenne prime exponent, as of October 2024139,854,276 = 118262, the smallest zeroless base 10 pandigital square142,547,559 = Motzkin number147,008,443 = 435148,035,889 = 121672 = 5293 = 236157,115,917 = number of parallelogram polyominoes with 24 cells.157,351,936 = 125442 = 1124164,916,224 = 445165,580,141 = Fibonacci number167,444,795 = cyclic number in base 6170,859,375 = 157171,794,492 = number of reduced trees with 36 nodes177,264,449 = Leyland number using 8 & 9 178,956,971 = smallest composite Wagstaff number with prime index179,424,673 = 10,000,000th prime number184,528,125 = 455185,794,560 = double factorial of 18188,378,402 = number of ways to partition and then partition each cell into subcells.190,899,322 = Bell number191,102,976 = 138242 = 5763 = 246192,622,052 = number of free 18-ominoes193,707,721 = smallest prime factor of 267 − 1, a number that Mersenne claimed to be prime199,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 10000205,962,976 = 465210,295,326 = Fine number211,016,256 = number of primitive polynomials of degree 33 over GF212,890,625 = 1-automorphic number214,358,881 = 146412 = 1214 = 118222,222,222 = repdigit222,222,227 = safe prime223,092,870 = the product of the first nine prime numbers, thus the ninth primorial225,058,681 = Pell number225,331,713 = self-descriptive number in base 9229,345,007 = 475232,792,560 = superior highly composite number; colossally abundant number; smallest number divisible by the numbers from 1 to 22 240,882,152 = number of signed trees with 16 nodes244,140,625 = 156252 = 1253 = 256 = 512244,389,457 = Leyland number using 5 & 12 244,330,711 = n such that n | 245,044,800 = first highly composite number that is not a Harshad number245,492,244 = number of 35-bead necklaces where complements are equivalent252,047,376 = 158762 = 1264252,648,992 = number of 34-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed253,450,711 = Wedderburn-Etherington prime254,803,968 = 485260,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 33267,914,296 = Fibonacci number268,435,456 = 163842 = 1284 = 167 = 414 = 228268,436,240 = Leyland number using 2 & 28 268,473,872 = Leyland number using 4 & 14 272,400,600 = the number of terms of the harmonic series required to pass 20275,305,224 = the number of magic squares of order 5, excluding rotations and reflections279,793,450 = number of trees with 26 unlabeled nodes282,475,249 = 168072 = 495 = 710292,475,249 = Leyland number using 7 & 10 294,130,458 = number of prime knots with 19 crossings299,792,458 = the exact definition of the speed of light in a vacuum, in metres per second

300,000,000 to 399,999,999

308,915,776 = 175762 = 6763 = 266309,576,725 = number of centered hydrocarbons with 28 carbon atoms312,500,000 = 505321,534,781 = Markov prime331,160,281 = Leonardo prime333,333,333 = repdigit336,849,900 = number of primitive polynomials of degree 34 over GF345,025,251 = 515350,238,175 = number of reduced trees with 37 nodes362,802,072 = number of parallelogram polyominoes with 25 cells364,568,617 = Leyland number using 6 & 11 365,496,202 = n such that n | 367,567,200 = 14th colossally abundant number, 14th superior highly composite number380,204,032 = 525381,654,729 = the only polydivisible number that is also a zeroless pandigital number387,420,489 = 196832 = 7293 = 276 = 99 = 318 and in tetration notation 29387,426,321 = Leyland number using 3 & 18

400,000,000 to 499,999,999

400,080,004 = 200022, palindromic square400,763,223 = Motzkin number404,090,404 = 201022, palindromic square404,204,977 = number of prime numbers having ten digits405,071,317 = 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88 + 99410,338,673 = 177418,195,493 = 535429,981,696 = 207362 = 1444 = 128 = 100,000,00012 AKA a gross-great-great-gross 433,494,437 = Fibonacci prime, Markov prime442,386,619 = alternating factorial444,101,658 = number of rooted trimmed trees with 27 nodes444,444,444 = repdigit455,052,511 = number of primes under 1010459,165,024 = 545467,871,369 = number of triangle-free graphs on 14 vertices477,353,376 = number of 36-bead necklaces where complements are equivalent477,638,700 = Catalan number479,001,599 = factorial prime479,001,600 = 12!481,890,304 = 219522 = 7843 = 286490,853,416 = number of 35-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed499,999,751 = Sophie Germain prime

500,000,000 to 599,999,999

503,284,375 = 555505,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 34522,808,225 = 228652, palindromic square535,828,591 = Leonardo prime536,870,911 = third composite Mersenne number with a prime exponent536,870,912 = 229536,871,753 = Leyland number using 2 & 29 542,474,231 = k such that the sum of the squares of the first k primes is divisible by k.543,339,720 = Pell number550,731,776 = 565554,999,445 = a Kaprekar constant for digit length 9 in base 10555,555,555 = repdigit574,304,985 = 19 + 29 + 39 + 49 + 59 + 69 + 79 + 89 + 99575,023,344 = 14-th derivative of xx at x=1594,823,321 = 243892 = 8413 = 296596,572,387 = Wedderburn-Etherington prime

600,000,000 to 699,999,999

601,692,057 = 575612,220,032 = 187617,323,716 = 248462, palindromic square635,318,657 = the smallest number that is the sum of two fourth powers in two different ways, of which Euler was aware.644,972,544 = 8643, 3-smooth number648,646,704 =, where φ is the Euler's totient function654,729,075 = double factorial of 19656,356,768 = 585666,666,666 = repdigit670,617,279 = highest stopping time integer under 109 for the Collatz conjecture

700,000,000 to 799,999,999

701,408,733 = Fibonacci number714,924,299 = 595715,497,037 = number of reduced trees with 38 nodes715,827,883 = Wagstaff prime, Jacobsthal prime725,594,112 = number of primitive polynomials of degree 36 over GF729,000,000 = 270002 = 9003 = 306742,624,232 = number of free 19-ominoes751,065,460 = number of trees with 27 unlabeled nodes774,840,978 = Leyland number using 9 & 9 777,600,000 = 605777,777,777 = repdigit778,483,932 = Fine number780,291,637 = Markov prime787,109,376 = 1-automorphic number797,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 factors815,730,721 = 1694, 138835,210,000 = 1704837,759,792 – number of parallelogram polyominoes with 26 cells.839,296,300 – initial number of first century xx00 to xx99 containing at least sixteen prime numbers since 2,705,000844,596,301 = 615855,036,081 = 1714875,213,056 = 1724887,503,681 = 316888,888,888 = repdigit893,554,688 = 2-automorphic number893,871,739 = 197895,745,041 = 1734

900,000,000 to 999,999,999

906,150,257 = smallest counterexample to the Polya conjecture916,132,832 = 625923,187,456 = 303842, the largest zeroless base-10 pandigital square928,772,650 = number of 37-bead necklaces where complements are equivalent929,275,200 = number of primitive polynomials of degree 35 over GF942,060,249 = 306932, palindromic square981,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 35987,654,321 = largest zeroless base-10 pandigital number992,436,543 = 635997,002,999 = 9993, the largest 9-digit cube999,950,884 = 316222, the largest 9-digit square999,961,560 = largest triangular number with 9 digits and the 44,720th triangular number999,999,937 = largest 9-digit prime number999,999,999 = repdigit