100,000,000,000

100000000000
List of numbers Integers ← 100 101 102 103 104 105 106 107 108 109 1010 1011
Cardinal	One hundred billion
Ordinal	One hundred billionth (short scale)
Factorization	211 511
Greek numeral	${\displaystyle {\stackrel {\alpha }{\mathrm {M} }}}$
Roman numeral	X
Binary	10111010010000111011011101000000000002
Ternary	1001200100111221000202013
Senary	1135345230145446
Octal	13510355640008
Duodecimal	1746996A45412
Hexadecimal	174876E80016

100,000,000,000 (one hundred billion) is the natural number following 99,999,999,999 and preceding 100,000,000,001.

In scientific notation, it is written as 10¹¹.

Selected 12-digit numbers (100,000,000,001–999,999,999,999)

100,000,000,001 to 199,999,999,999

• 100,000,000,003 = smallest 12-digit prime number. ^[1]
• 100,000,147,984 = 316228², the smallest 12-digit square.
• 100,000,404,505 = smallest triangular number with 12 digits and the 447,214th triangular number
• 102,280,151,422 = number of 43-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed ^[2]
• 107,578,520,350 = 30th Pell number. ^[3]
• 109,972,410,221 = number of trees with 32 unlabeled nodes ^[4]
• 110,075,314,176 = 331776² = 576⁴ = 24⁸
• 111,111,111,111 = repunit
• 118,587,876,497 = 4913³ = 17⁹
• 127,004,500,762 = number of parallelogram polyominoes with 32 cells. ^[5]
• 128,367,472,469 = Markov prime
• 134,474,581,374 = number of secondary structures of RNA molecules with 32 nucleotides ^[6]
• 137,438,691,328 = 7th perfect number. ^[7]
• 137,438,953,472 = 2³⁷
• 137,858,491,849 = 371293² = 169⁵ = 13¹⁰
• 139,355,139,206 = number of signed trees with 20 nodes ^[8]
• 139,583,862,445 = 55th Fibonacci number.
• 143,367,113,573 = Markov prime
• 145,540,468,640 = number of series-reduced planted trees with 42 nodes ^[9]
• 152,587,890,625 = 390625² = 625⁴ = 25⁸ = 5¹⁶
• 168,047,007,728 = number of free 23-ominoes
• 172,765,826,641 = Markov prime
• 186,492,227,801 = self-descriptive number in base 11
• 195,470,831,356 = number of 45-bead necklaces (turning over is allowed) where complements are equivalent ^[10]
• 198,359,290,368 = 5832³ = 18⁹
• 198,585,576,189 = only known Descartes number
• 199,911,300,472 = number of 44-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed ^[2]

200,000,000,000 to 299,999,999,999

• 200,560,490,130 = eleventh primorial
• 208,023,278,209 = 28th Motzkin number. ^[11]
• 222,222,222,222 = repdigit
• 225,851,433,717 = 56th Fibonacci number.
• 247,489,226,192 = number of centered hydrocarbons with 35 carbon atoms ^[12]
• 252,097,800,623 = 10,000,000,000th prime number
• 255,323,504,932 = logarithmic number. ^[13]
• 259,717,522,849 = 31st Pell number. ^[3]
• 274,877,906,944 = 524288² = 4¹⁹ = 2³⁸
• 277,945,762,500 = 2²×3³×5⁵×7^{7 [14]}
• 282,429,536,481 = 531441² = 6561³ = 729⁴ = 81⁶ = 27⁸ = 9¹² = 3²⁴
• 285,311,670,611 = 11¹¹
• 289,254,654,976 = 537824² = 196⁵ = 14¹⁰
• 293,270,987,832 = number of parallelogram polyominoes with 33 cells. ^[5]

300,000,000,000 to 399,999,999,999

• 300,628,862,480 = number of trees with 33 unlabeled nodes ^[4]
• 307,272,063,019 = number of series-reduced planted trees with 43 nodes ^[9]
• 308,457,624,821 = number of prime numbers having thirteen digits ^[15]
• 311,809,494,089 = Markov prime
• 316,234,143,225 = double factorial of 23
• 321,253,732,800 = superior highly composite number ^[16]
• 322,687,697,779 = 6859³ = 19⁹
• 333,333,333,333 = repdigit made of 3s
• 336,908,488,839 = number of secondary structures of RNA molecules with 33 nucleotides ^[6]
• 343,059,613,650 = Catalan number ^[17]
• 346,065,536,839 = number of primes under 10¹³
• 365,435,296,162 = 57th Fibonacci number.
• 382,443,112,538 = number of 46-bead necklaces (turning over is allowed) where complements are equivalent ^[10]
• 390,937,468,408 = number of 45-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed ^[2]

400,000,000,000 to 499,999,999,999

• 444,444,444,444 = repdigit
• 470,184,984,576 = 7776³ = 216⁵ = 6¹⁵

500,000,000,000 to 599,999,999,999

• 500,000,500,000 = sum of first 1,000,000 integers
• 512,000,000,000 = 8000³ = 20⁹
• 549,755,813,888 = 8192³ = 8¹³ = 2³⁹
• 555,555,555,555 = repdigit
• 576,650,390,625 = 759375² = 225⁵ = 15¹⁰
• 591,286,729,879 = 58th Fibonacci number.
• 593,742,784,829 = 29th Motzkin number. ^[11]

600,000,000,000 to 699,999,999,999

• 608,981,813,029 = smallest number for which there are more primes up to the number of the form 3k + 1 than of the form 3k + 2.
• 619,737,131,179 = largest number such that every pair of consecutive digits is a distinct prime.
• 627,013,566,048 = 32nd Pell number. ^[3]
• 649,164,795,179 = number of centered hydrocarbons with 36 carbon atoms ^[12]
• 649,287,537,982 = number of series-reduced planted trees with 44 nodes ^[9]
• 654,999,700,403 = number of free 24-ominoes
• 666,666,666,666 = repdigit
• 677,203,347,266 = number of parallelogram polyominoes with 34 cells. ^[5]
• 678,223,072,849 = 823543² = 49⁷ = 7¹⁴
• 682,076,806,159 = 18th Bell number. ^[18]
• 695,808,554,300 = number of signed trees with 21 nodes ^[8]

700,000,000,000 to 799,999,999,999

• 743,008,370,688 = 12¹¹
• 748,607,855,769 = number of 47-bead necklaces (turning over is allowed) where complements are equivalent ^[10]
• 762,939,453,125 = 5¹⁷
• 764,877,836,468 = number of 46-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed ^[2]
• 777,777,777,777 = repdigit

800,000,000,000 to 899,999,999,999

• 823,779,631,721 = number of trees with 34 unlabeled nodes ^[4]
• 845,139,060,165 = number of secondary structures of RNA molecules with 34 nucleotides ^[6]
• 847,288,609,443 = 243⁵ = 3²⁵
• 888,888,888,888 = repdigit

900,000,000,000 to 999,999,999,999

• 918,212,890,625 = 1-automorphic number ^[19]
• 956,722,026,041 = 59th Fibonacci number.
• 999,999,999,989 = largest 12-digit prime number ^[20]
• 999,999,999,999 = largest 12-digit number, repdigit

References

1. Sloane, N. J. A. (ed.). "SequenceA003617(Smallest n-digit prime)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
2. Sloane, N. J. A. (ed.). "SequenceA000013(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)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
3. Sloane, N. J. A. (ed.). "SequenceA000129(Pell numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
4. Sloane, N. J. A. (ed.). "SequenceA000055(Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
5. Sloane, N. J. A. (ed.). "SequenceA006958(Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
6. Sloane, N. J. A. (ed.). "SequenceA004148(Generalized Catalan numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
7. Sloane, N. J. A. (ed.). "SequenceA000396(Perfect numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
8. Sloane, N. J. A. (ed.). "SequenceA000060(Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
9. Sloane, N. J. A. (ed.). "SequenceA001678(Number of series-reduced planted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
10. Sloane, N. J. A. (ed.). "SequenceA000011(Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
11. Sloane, N. J. A. (ed.). "SequenceA001006(Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
12. Sloane, N. J. A. (ed.). "SequenceA000022(Number of centered hydrocarbons with n atoms)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
13. Sloane, N. J. A. (ed.). "SequenceA002104(Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
14. Sloane, N. J. A. (ed.). "SequenceA048102(Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
15. Sloane, N. J. A. (ed.). "SequenceA006879(Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
16. Sloane, N. J. A. (ed.). "SequenceA002201(Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
17. Sloane, N. J. A. (ed.). "SequenceA000108(Catalan numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
18. Sloane, N. J. A. (ed.). "SequenceA000110(Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
19. Sloane, N. J. A. (ed.). "SequenceA003226(Automorphic numbers: m^2 ends with m.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
20. Sloane, N. J. A. (ed.). "SequenceA003618(Largest n-digit prime)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.