Natural number
100,000,000,000 (one hundred billion) is the natural number following 99,999,999,999 and preceding 100,000,000,001.
Inscientific notation, it is written as 1011.
Selected 12-digit numbers (100,000,000,001–999,999,999,999)
[edit]100,000,000,001 to 199,999,999,999
[edit]- 100,000,000,003 = smallest 12-digitprime number.[1]
- 100,000,147,984 = 3162282, the smallest 12-digit square.
- 100,000,404,505 = smallesttriangular 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 = 30thPell number.[3]
- 109,972,410,221 = number of trees with 32 unlabeled nodes[4]
- 110,075,314,176 = 3317762 = 5764 = 248
- 111,111,111,111 =repunit
- 118,587,876,497 = 49133 = 179
- 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 = 7thperfect number.[7]
- 137,438,953,472 = 237
- 137,858,491,849 = 3712932 = 1695 = 1310
- 139,355,139,206 = number of signed trees with 20 nodes[8]
- 139,583,862,445 = 55thFibonacci 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 = 3906252 = 6254 = 258 = 516
- 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 = 58323 = 189
- 198,585,576,189 = only knownDescartes 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
[edit]- 200,560,490,130 = eleventhprimorial
- 208,023,278,209 = 28thMotzkin 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 = 5242882 = 419 = 238
- 277,945,762,500 = 22×33×55×77[14]
- 282,429,536,481 = 5314412 = 65613 = 7294 = 816 = 278 = 912 = 324
- 285,311,670,611 = 1111
- 289,254,654,976 = 5378242 = 1965 = 1410
- 293,270,987,832 = number of parallelogram polyominoes with 33 cells.[5]
300,000,000,000 to 399,999,999,999
[edit]- 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 = 68593 = 199
- 333,333,333,333 = repdigit made of3s
- 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 1013
- 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
[edit]- 444,444,444,444 = repdigit
- 470,184,984,576 = 77763 = 2165 = 615
500,000,000,000 to 599,999,999,999
[edit]- 500,000,500,000 = sum of first 1,000,000 integers
- 512,000,000,000 = 80003 = 209
- 549,755,813,888 = 81923 = 813 = 239
- 555,555,555,555 = repdigit
- 576,650,390,625 = 7593752 = 2255 = 1510
- 591,286,729,879 = 58th Fibonacci number.
- 593,742,784,829 = 29th Motzkin number.[11]
600,000,000,000 to 699,999,999,999
[edit]- 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 = 8235432 = 497 = 714
- 682,076,806,159 = 18thBell number.[18]
- 695,808,554,300 = number of signed trees with 21 nodes[8]
700,000,000,000 to 799,999,999,999
[edit]- 743,008,370,688 = 1211
- 748,607,855,769 = number of 47-bead necklaces (turning over is allowed) where complements are equivalent[10]
- 762,939,453,125 = 517
- 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
[edit]- 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 = 2435 = 325
- 888,888,888,888 = repdigit
900,000,000,000 to 999,999,999,999
[edit]- 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
- ^Sloane, N. J. A. (ed.)."Sequence A003617 (Smallest n-digit prime)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcdSloane, N. J. A. (ed.)."Sequence A000013 (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)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcSloane, N. J. A. (ed.)."Sequence A000129 (Pell numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcSloane, N. J. A. (ed.)."Sequence A000055 (Number of trees with n unlabeled nodes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcSloane, N. J. A. (ed.)."Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcSloane, N. J. A. (ed.)."Sequence A004148 (Generalized Catalan numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A000396 (Perfect numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abSloane, N. J. A. (ed.)."Sequence A000060 (Number of signed trees with n nodes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcSloane, N. J. A. (ed.)."Sequence A001678 (Number of series-reduced planted trees with n nodes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abcSloane, N. J. A. (ed.)."Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abSloane, N. J. A. (ed.)."Sequence A001006 (Motzkin numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^abSloane, N. J. A. (ed.)."Sequence A000022 (Number of centered hydrocarbons with n atoms)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A002104 (Logarithmic numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A048102 (Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A006879 (Number of primes with n digits.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A002201 (Superior highly composite numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A000108 (Catalan numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A000110 (Bell or exponential numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A003226 (Automorphic numbers: m^2 ends with m.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A003618 (Largest n-digit prime)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
|
|---|
Examples in numerical order | |
|---|
Expression methods | |
|---|
Related articles (alphabetical order)
| |
|---|
|
|
|---|
|
|
|
400 to 999 |
|---|
| 400s, 500s, and 600s | 700s, 800s, and 900s | | |
|
|
1000s and 10,000s |
|---|
| 1000s | |
|---|
| 10,000s | |
|---|
|
100,000s to 10,000,000,000,000s |
|---|
- 100,000
- 1,000,000
- 10,000,000
- 100,000,000
- 1,000,000,000
- 10,000,000,000
- 100,000,000,000
- 1,000,000,000,000
- 10,000,000,000,000
|
|
|