100,000,000 (one hundred million) is the

natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...

following 99,999,999 and preceding 100,000,001. In

scientific notation Scientific notation is a way of expressing numbers that are too large or too small to be conveniently written in decimal form, since to do so would require writing out an inconveniently long string of digits. It may be referred to as scientif ...

, 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'' () (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 and also the

square In geometry, a square is a regular polygon, regular quadrilateral. It has four straight sides of equal length and four equal angles. Squares are special cases of rectangles, which have four equal angles, and of rhombuses, which have four equal si ...

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 A triangular number or triangle number counts objects arranged in an equilateral triangle. Triangular numbers are a type of figurate number, other examples being square numbers and cube numbers. The th triangular number is the number of dots in ...

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 In mathematics, the Fibonacci sequence is a Integer sequence, sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted . Many w ...

* 102,400,000 = 40⁵ * 104,060,401 = 10201² = 101⁴, palindromic square * 104,636,890 = number of trees with 25 unlabeled nodes * 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 In number theory, a prime number ''p'' is a if 2''p'' + 1 is also prime. The number 2''p'' + 1 associated with a Sophie Germain prime is called a . For example, 11 is a Sophie Germain prime and 2 × 11 +&nbs ...

, cousin prime. * 113,379,904 = 10648² = 484³ = 22⁶ * 115,856,201 = 41⁵ * 119,481,296 = logarithmic number * 120,528,657 = number of centered hydrocarbons with 27 carbon atoms * 121,242,121 = 11011², palindromic square * 122,522,400 = least number

m

such that

\frac > 5

, where

\sigma(m)

= sum of divisors of m * 123,454,321 = 11111², palindromic square * 123,456,789 = smallest zeroless base 10 pandigital number * 125,686,521 = 11211², 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¹⁷ * 129,145,076 = Leyland number using 3 & 17 (3¹⁷ + 17³) * 129,644,790 =

Catalan number The Catalan numbers are a sequence of natural numbers that occur in various Enumeration, counting problems, often involving recursion, recursively defined objects. They are named after Eugène Charles Catalan, Eugène Catalan, though they were p ...

* 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⁵ * 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,048,896 = 11664² = 108⁴ * 136,279,841 = The largest known

Mersenne prime In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form for some integer . They are named after Marin Mersenne, a French Minim friar, who studied them in the early 1 ...

exponent, as of October 2024 * 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 =

* 167,444,795 = cyclic number in

base 6 A senary () numeral system (also known as base-6, heximal, or seximal) has six as its base. It has been adopted independently by a small number of cultures. Like the decimal base 10, the base is a semiprime, though it is unique as the product ...

* 170,859,375 = 15⁷ * 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 * 179,424,673 = 10,000,000th

prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), 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 ...

* 184,528,125 = 45⁵ * 185,794,560 = double factorial of 18 * 188,378,402 = number of ways to partition and then partition each cell (block) into subcells. * 190,899,322 =

Bell number In combinatorial mathematics, the Bell numbers count the possible partitions of a set. These numbers have been studied by mathematicians since the 19th century, and their roots go back to medieval Japan. In an example of Stigler's law of epony ...

* 191,102,976 = 13824² = 576³ = 24⁶ * 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 * 205,962,976 = 46⁵ * 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² = 121⁴ = 11⁸ * 222,222,222 =

repdigit In recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system (often implicitly decimal). The word is a portmanteau of "repeated" and "digit". Ex ...

* 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 In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins , , , , an ...

* 225,331,713 =

self-descriptive number In mathematics, a self-descriptive number is an integer ''m'' in a given base ''b'' that is ''b'' digits long, and each digit ''d'' at position ''n'' (the most significant digit being at position 0 and the least significant at position ''b''− ...

in base 9 * 229,345,007 = 47⁵ * 232,792,560 =

superior highly composite number In number theory, a superior highly composite number is a natural number which, in a particular rigorous sense, has many divisors. Particularly, it is defined by a ratio between the number of divisors an integer has and that integer raised to s ...

; 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² = 125³ = 25⁶ = 5¹² * 244,389,457 = Leyland number using 5 & 12 (5¹² + 12⁵) * 244,330,711 = n such that n , (3ⁿ + 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⁵ * 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 =

* 268,435,456 = 16384² = 128⁴ = 16⁷ = 4¹⁴ = 2²⁸ * 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 square In mathematics, especially History of mathematics, historical and 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 diago ...

s of order 5, excluding rotations and reflections * 279,793,450 = number of trees with 26 unlabeled nodes * 282,475,249 = 16807² = 49⁵ = 7¹⁰ * 292,475,249 = Leyland number using 7 & 10 (7¹⁰ + 10⁷) * 294,130,458 = number of prime knots with 19 crossings

300,000,000 to 399,999,999

* 308,915,776 = 17576² = 676³ = 26⁶ * 309,576,725 = number of centered hydrocarbons with 28 carbon atoms * 312,500,000 = 50⁵ * 321,534,781 = Markov prime * 331,160,281 = Leonardo prime * 333,333,333 =

* 336,849,900 = number of primitive polynomials of degree 34 over GF(2) * 345,025,251 = 51⁵ * 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⁶) * 365,496,202 = n such that n , (3ⁿ + 5) * 367,567,200 = 14th colossally abundant number, 14th

* 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 In mathematics, tetration (or hyper-4) is an operation (mathematics), operation based on iterated, or repeated, exponentiation. There is no standard mathematical notation, notation for tetration, though Knuth's up arrow notation \uparrow \upa ...

notation ²9 * 387,426,321 = Leyland number using 3 & 18 (3¹⁸ + 18³)

400,000,000 to 499,999,999

* 400,080,004 = 20002², palindromic square * 400,763,223 = Motzkin number * 404,090,404 = 20102², palindromic square * 404,204,977 = number of prime numbers having ten digits * 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, Markov prime * 442,386,619 = alternating factorial * 444,101,658 = number of (unordered, unlabeled) rooted trimmed trees with 27 nodes * 444,444,444 =

* 455,052,511 = number of primes under 10¹⁰ * 459,165,024 = 54⁵ * 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 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! + 1 or 1! + 1) ...

* 479,001,600 = 12! * 481,890,304 = 21952² = 784³ = 28⁶ * 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 =

500,000,000 to 599,999,999

* 503,284,375 = 55⁵ * 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², palindromic square * 535,828,591 = Leonardo prime * 536,870,911 = third composite

Mersenne number In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form for some integer . They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17t ...

with a prime exponent * 536,870,912 = 2²⁹ * 536,871,753 = Leyland number using 2 & 29 (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 number * 550,731,776 = 56⁵ * 554,999,445 = a Kaprekar constant for digit length 9 in base 10 * 555,555,555 =

* 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 * 635,318,657 = the smallest number that is the sum of two fourth powers in two different ways (), of which

Euler Leonhard Euler ( ; ; ; 15 April 170718 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, and engineer. He founded the studies of graph theory and topology and made influential ...

was aware. * 644,972,544 = 864³, 3-

smooth number In number theory, an ''n''-smooth (or ''n''-friable) number is an integer whose prime factors are all less than or equal to ''n''. For example, a 7-smooth number is a number in which every prime factor is at most 7. Therefore, 49 = 72 and 15750 = 2 ...

* 648,646,704 = , where ''φ'' is the

Euler's totient function In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to . It is written using the Greek letter phi as \varphi(n) or \phi(n), and may also be called Euler's phi function. In ot ...

* 654,729,075 = double factorial of 19 * 656,356,768 = 58⁵ * 666,666,666 =

* 670,617,279 = highest stopping time

integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...

under 10⁹ for the

Collatz conjecture The Collatz conjecture is one of the most famous List of unsolved problems in mathematics, unsolved problems in mathematics. The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer ...

700,000,000 to 799,999,999

* 701,408,733 =

* 714,924,299 = 59⁵ * 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² = 900³ = 30⁶ * 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⁹) * 777,600,000 = 60⁵ * 777,777,777 =

* 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⁸ * 815,730,721 = 169⁴ * 835,210,000 = 170⁴ * 837,759,792 – number of parallelogram polyominoes with 26 cells. * 844,596,301 = 61⁵ * 855,036,081 = 171⁴ * 875,213,056 = 172⁴ * 887,503,681 = 31⁶ * 888,888,888 –

* 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 * 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², 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⁵ * 997,002,999 = 999³, the largest 9-digit cube * 999,950,884 = 31622², the largest 9-digit square * 999,961,560 = largest

with 9 digits and the 44,720th triangular number * 999,999,937 = largest 9-digit prime number * 999,999,999 =

References

{{DEFAULTSORT:100000000 Integers Large numbers Powers of ten