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 A myriad (from Ancient Greek grc, μυριάς, translit=myrias, label=none) is technically the number 10,000 (ten thousand); in that sense, the term is used in English almost exclusively for literal translations from Greek, Latin or Sinospher ...

, also a counting unit. In Chinese, Korean, and Japanese respectively it is ''yi'' () (or 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 100 or one hundred (Roman numeral: C) is the natural number following 99 and preceding 101. In medieval contexts, it may be described as the short hundred or five score in order to differentiate the English and Germanic use of "hundred" to de ...

and also the square of

10000 10,000 (ten thousand) is the natural number following 9,999 and preceding 10,001. Name Many languages have a specific word for this number: in Ancient Greek it is (the etymological root of the word myriad in English), in Aramaic , in Hebrew ...

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 * 102,400,000 = 40⁵ * 104,060,401 = 10201² = 101⁴, palindromic square * 105,413,504 = 14⁷ * 107,890,609 = Wedderburn-Etherington number * 111,111,111 = repunit, square root of 12345678987654321 * 111,111,113 = Chen prime, Sophie Germain prime,

cousin prime In number theory, cousin primes are prime numbers that differ by four. Compare this with twin primes, pairs of prime numbers that differ by two, and sexy primes, pairs of prime numbers that differ by six. The cousin primes (sequences and in OE ...

. * 113,379,904 = 10648² = 484³ = 22⁶ * 115,856,201 = 41⁵ * 119,481,296 = logarithmic number * 121,242,121 = 11011², palindromic square * 123,454,321 = 11111², palindromic square * 123,456,789 = smallest zeroless base 10 pandigital number * 125,686,521 = 11211², palindromic square * 126,491,971 = Leonardo prime * 129,140,163 = 3¹⁷ * 129,145,076 = Leyland number * 129,644,790 = Catalan number * 130,691,232 = 42⁵ * 134,217,728 = 512³ = 8⁹ = 2²⁷ * 134,218,457 = Leyland number * 136,048,896 = 11664² = 108⁴ * 139,854,276 = 11826², the smallest zeroless base 10 pandigital square * 142,547,559 = Motzkin number * 147,008,443 = 43⁵ * 148,035,889 = 12167² = 529³ = 23⁶ * 157,115,917 – number of parallelogram polyominoes with 24 cells. * 157,351,936 = 12544² = 112⁴ * 164,916,224 = 44⁵ * 165,580,141 = Fibonacci number * 167,444,795 = cyclic number in

base 6 A senary () numeral system A numeral system (or system of numeration) is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using Numerical digit, digits or other symbols in a ...

* 170,859,375 = 15⁷ * 177,264,449 = Leyland number * 179,424,673 = 10,000,000th prime number * 184,528,125 = 45⁵ * 188,378,402 = number of ways to partition and then partition each cell (block) into subcells. * 190,899,322 = Bell number * 191,102,976 = 13824² = 576³ = 24⁶ * 192,622,052 = number of free 18-ominoes * 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⁵ * 210,295,326 = Fine number * 212,890,625 = 1- automorphic number * 214,358,881 = 14641² = 121⁴ = 11⁸ * 222,222,222 = repdigit * 222,222,227 = safe prime * 223,092,870 = the product of the first nine

prime numbers A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...

, thus the ninth

primorial In mathematics, and more particularly in number theory, primorial, denoted by "#", is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, the function ...

* 225,058,681 = Pell number * 225,331,713 = self-descriptive number in base 9 * 229,345,007 = 47⁵ * 232,792,560 =

superior highly composite number In mathematics, a superior highly composite number is a natural number which has the highest ratio of its number of divisors to ''some'' positive power of itself than any other number. It is a stronger restriction than that of a highly composite ...

;

colossally abundant number In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a natural number that, in a particular, rigorous sense, has many divisors. Formally, a number ''n'' is said to be colossally abundant if there is an ε > 0 su ...

; the smallest number divisible by all the numbers 1 through 22 * 244,140,625 = 15625² = 125³ = 25⁶ = 5¹² * 244,389,457 = Leyland number * 244,330,711 = n such that n , (3ⁿ + 5) * 253,450,711 = Wedderburn-Etherington prime * 254,803,968 = 48⁵ * 267,914,296 = Fibonacci number * 268,435,456 = 16384² = 128⁴ = 16⁷ = 4¹⁴ = 2²⁸ * 268,436,240 = Leyland number * 268,473,872 = Leyland number * 272,400,600 = the number of terms of the harmonic series required to pass 20 * 275,305,224 = the number of

magic square In recreational mathematics, a square array of numbers, usually positive integers, is called a magic square if the sums of the numbers in each row, each column, and both main diagonals are the same. The 'order' of the magic square is the number ...

s of order 5, excluding rotations and reflections * 282,475,249 = 16807² = 49⁵ = 7¹⁰ * 292,475,249 = Leyland number

300,000,000 to 399,999,999

* 308,915,776 = 17576² = 676³ = 26⁶ * 312,500,000 = 50⁵ * 321,534,781 = Markov prime * 331,160,281 = Leonardo prime * 333,333,333 = repdigit * 345,025,251 = 51⁵ * 362,802,072 – number of parallelogram polyominoes with 25 cells. * 364,568,617 = Leyland number * 365,496,202 = n such that n , (3ⁿ + 5) * 367,567,200 =

* 380,204,032 = 52⁵ * 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

400,000,000 to 499,999,999

* 400,080,004 = 20002², palindromic square * 400,763,223 = Motzkin number * 404,090,404 = 20102², palindromic square * 405,071,317 = 1¹ + 2² + 3³ + 4⁴ + 5⁵ + 6⁶ + 7⁷ + 8⁸ + 9⁹ * 410,338,673 = 17⁷ * 418,195,493 = 53⁵ * 429,981,696 = 20736² = 144⁴ = 12⁸ = 100,000,000₁₂ AKA a gross-great-great-gross (100₁₂ great-great-grosses) * 433,494,437 =

Fibonacci prime A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime. The first Fibonacci primes are : : 2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437, 2971215073, .... Known Fibonacci primes It is not known whet ...

, Markov prime * 442,386,619 =

alternating factorial Alternating may refer to: Mathematics * Alternating algebra, an algebra in which odd-grade elements square to zero * Alternating form, a function formula in algebra * Alternating group, the group of even permutations of a finite set * Alternati ...

* 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¹⁰ * 459,165,024 = 54⁵ * 467,871,369 = number of triangle-free graphs on 14 vertices * 477,638,700 = Catalan number * 479,001,599 =

factorial prime A factorial prime is a prime number that is one less or one more than a factorial (all factorials greater than 1 are even). The first 10 factorial primes (for ''n'' = 1, 2, 3, 4, 6, 7, 11, 12, 14) are : : 2 (0! +&n ...

* 479,001,600 = 12! * 481,890,304 = 21952² = 784³ = 28⁶ * 499,999,751 = Sophie Germain prime

500,000,000 to 599,999,999

* 503,284,375 = 55⁵ * 522,808,225 = 22865², palindromic square * 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 * 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⁵ * 554,999,445 = a Kaprekar constant for digit length 9 in base 10 * 555,555,555 = repdigit * 574,304,985 = 1⁹ + 2⁹ + 3⁹ + 4⁹ + 5⁹ + 6⁹ + 7⁹ + 8⁹ + 9⁹ * 575,023,344 = 14-th derivative of x^x at x=1 * 594,823,321 = 24389² = 841³ = 29⁶ * 596,572,387 = Wedderburn-Etherington prime

600,000,000 to 699,999,999

* 601,692,057 = 57⁵ * 612,220,032 = 18⁷ * 617,323,716 = 24846², palindromic square * 644,972,544 = 864³, 3- smooth number * 656,356,768 = 58⁵ * 666,666,666 = repdigit * 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 * 714,924,299 = 59⁵ * 715,827,883 =

Wagstaff prime In number theory, a Wagstaff prime is a prime number of the form : where ''p'' is an odd prime. Wagstaff primes are named after the mathematician Samuel S. Wagstaff Jr.; the prime pages credit François Morain for naming them in a lecture at the ...

, Jacobsthal prime * 729,000,000 = 27000² = 900³ = 30⁶ * 742,624,232 = number of free 19-ominoes * 774,840,978 = Leyland number * 777,600,000 = 60⁵ * 777,777,777 = repdigit * 778,483,932 = Fine number * 780,291,637 = Markov prime * 787,109,376 = 1- automorphic number

800,000,000 to 899,999,999

* 801,765,089 = 929³ * 804,357,000 = 930³ * 806,954,491 = 931³ * 809,557,568 = 932³ * 812,166,237 = 933³ * 814,780,504 = 934³ * 815,730,721 = 13⁸ * 815,730,721 = 169⁴ * 817,400,375 = 935³ * 820,025,856 = 936³ * 822,656,953 = 937³ * 825,293,672 = 938³ * 827,936,019 = 939³ * 830,584,000 = 940³ * 833,237,621 = 941³ * 835,210,000 = 170⁴ * 835,896,888 = 942³ * 837,759,792 – number of parallelogram polyominoes with 26 cells. * 838,561,807 = 943³ * 841,232,384 = 944³ * 843,908,625 = 945³ * 844,596,301 = 61⁵ * 846,590,536 = 946³ * 849,278,123 = 947³ * 851,971,392 = 948³ * 854,670,349 = 949³ * 855,036,081 = 171⁴ * 857,375,000 = 950³ * 860,085,351 = 951³ * 862,801,408 = 952³ * 865,523,177 = 953³ * 868,250,664 = 954³ * 870,983,875 = 955³ * 873,722,816 = 956³ * 875,213,056 = 172⁴ * 876,467,493 = 957³ * 879,217,912 = 958³ * 881,974,079 = 959³ * 884,736,000 = 960³ * 887,503,681 = 31⁶ * 887,503,681 = 961³ * 888,888,888 – repdigit * 890,277,128 = 962³ * 893,056,347 = 963³ * 893,554,688 = 2- automorphic number * 893,871,739 = 19⁷ * 895,745,041 = 173⁴

900,000,000 to 999,999,999

* 906,150,257 = smallest counterexample to the Polya conjecture * 916,132,832 = 62⁵ * 923,187,456 = 30384², the largest zeroless pandigital square * 942,060,249 = 30693², palindromic square * 987,654,321 = largest zeroless pandigital number * 992,436,543 = 63⁵ * 997,002,999 = 999³, the largest 9-digit cube * 999,950,884 = 31622², the largest 9-digit square * 999,961,560 = highest triangular number with 9 digits and the 44,720th triangular number * 999,999,937 = largest 9-digit prime number * 999,999,999 = repdigit

References

{{DEFAULTSORT:100000000 Integers