100,000,000

Template:Redirect Template:Infobox number 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⁸.

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 (Template:Lang-zh) (or Template:Lang-zh in ancient texts), eok (Template:Lang) and oku (Template: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 and also the square of 10,000.

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², palindromic square
• 100,544,625 = 465³, the smallest 9-digit cube
• 102,030,201 = 10101², palindromic square
• 102,334,155 = Fibonacci number
• 104,636,890 = number of trees with 25 unlabeled nodes
• 107,890,609 = Wedderburn-Etherington number
• 111,111,111 = repunit, square root of 12345678987654321
• 111,111,113 = Chen prime, Sophie Germain prime, cousin prime.
• 120,528,657 = number of centered hydrocarbons with 27 carbon atoms
• 122,522,400 = least number $m$ such that $\frac{\sigma (m)}{m}>5$, where $\sigma (m)$ = sum of divisors of m
• 123,456,789 = smallest zeroless base-10 pandigital number
• 126,390,032 = number of 34-bead necklaces (turning over is allowed) where complements are equivalent
• 126,491,971 = Leonardo prime
• 129,145,076 = Leyland number using 3 & 17 (3¹⁷ + 17³)
• 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
• 134,217,728 = 512³ = 8⁹ = 2²⁷
• 134,218,457 = Leyland number using 2 & 27 (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 32
• 136,279,841 = The largest known Mersenne prime exponent, as of October 2024
• 139,854,276 = 11826², the smallest zeroless base 10 pandigital square
• 142,547,559 = Motzkin number
• 157,115,917 = number of parallelogram polyominoes with 24 cells.
• 165,580,141 = Fibonacci number
• 167,444,795 = cyclic number in base 6
• 171,794,492 = number of reduced trees with 36 nodes
• 177,264,449 = Leyland number using 8 & 9 (8⁹ + 9⁸)
• 178,956,971 = smallest composite Wagstaff number with prime index
• 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
• 192,622,052 = number of free 18-ominoes
• 193,707,721 = smallest prime factor of 2⁶⁷ − 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
• 210,295,326 = Fine number
• 211,016,256 = number of primitive polynomials of degree 33 over GF(2)
• 212,890,625 = 1-automorphic number
• 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
• 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² = 625³ = 125⁴ = 25⁶ = 5¹²
• 244,389,457 = Leyland number using 5 & 12 (5¹² + 12⁵)
• 245,044,800 = first highly composite number that is not a Harshad number
• 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
• 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,436,240 = Leyland number using 2 & 28 (2²⁸ + 28²)
• 268,473,872 = Leyland number using 4 & 14 (4¹⁴ + 14⁴)
• 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
• 292,475,249 = Leyland number using 7 & 10 (7¹⁰ + 10⁷)
• 294,130,458 = number of prime knots with 19 crossings
• 299,792,458 = the exact definition of the speed of light in a vacuum, in metres per second

300,000,000 to 399,999,999

• 309,576,725 = number of centered hydrocarbons with 28 carbon atoms
• 321,534,781 = Markov prime
• 331,160,281 = Leonardo prime
• 336,849,900 = number of primitive polynomials of degree 34 over GF(2)
• 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⁶)
• 367,567,200 = 14th colossally abundant number, 14th superior highly composite number
• 381,654,729 = the only polydivisible number that is also a zeroless pandigital number
• 387,420,489 = 19683² = 729³ = 27⁶ = 9⁹ = 3¹⁸ and in tetration notation ²9
• 387,426,321 = Leyland number using 3 & 18 (3¹⁸ + 18³)

400,000,000 to 499,999,999

• 400,763,223 = Motzkin number
• 404,204,977 = number of prime numbers having ten digits
• 405,071,317 = 1¹ + 2² + 3³ + 4⁴ + 5⁵ + 6⁶ + 7⁷ + 8⁸ + 9⁹
• 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
• 455,052,511 = number of primes below 10¹⁰
• 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!
• 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

• 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
• 535,828,591 = Leonardo prime
• 536,870,911 = third composite Mersenne number with a prime exponent
• 536,870,912 = 2²⁹
• 536,871,753 = Leyland number using 2 & 29 (2²⁹ + 29²)
• 543,339,720 = Pell number
• 554,999,445 = a Kaprekar constant for digit length 9 in base 10
• 556,069,849 = 14,149 × 39,301, the 1,000th strong pseudoprime to base 2
• 574,304,985 = 1⁹ + 2⁹ + 3⁹ + 4⁹ + 5⁹ + 6⁹ + 7⁹ + 8⁹ + 9⁹Template:Hair space
• 575,023,344 = 14-th derivative of x^x at x=1
• 596,572,387 = Wedderburn-Etherington prime

600,000,000 to 699,999,999

• 617,323,716 = 24846², palindromic square
• 635,318,657 = the smallest number that is the sum of two fourth powers in two different ways (Template:Nowrap), of which Euler was aware.
• 644,972,544 = 864³, 3-smooth number
• 648,646,704 = Template:Math, where φ is the Euler's totient function
• 654,729,075 = double factorial of 19
• 670,617,279 = highest stopping time integer under 10⁹ for the Collatz conjecture

700,000,000 to 799,999,999

• 701,408,733 = Fibonacci number
• 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)
• 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⁹)
• 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
• 837,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 {839,296,301, 839,296,303, 839,296,309, 839,296,319, 839,296,321, 839,296,327, 839,296,331, 839,296,333, 839,296,349, 839,296,351, 839,296,357, 839,296,361, 839,296,373, 839,296,379, 839,296,397, 839,296,399} since 2,705,000Template:Efn
• 893,554,688 = 2-automorphic number

900,000,000 to 999,999,999

• 906,150,257 = smallest counterexample to the Polya conjecture
• 923,187,456 = 30384², the largest zeroless base-10 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)
• 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 base-10 pandigital number
• 997,002,999 = 999³, the largest 9-digit cube
• 999,950,884 = 31622², 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

External links

• Fine number