Natural number
10,000,000,000 (ten billion ) is thenatural number following 9,999,999,999 and preceding 10,000,000,001.
Inscientific notation , it is written as 1010 . It can be also written intetration notation as2 10.
10,000,000,000 is also thefifth power of100 and also thesquare of100,000 .
Selected 11-digit numbers (10,000,000,000–99,999,999,999)[ edit ] 10,000,000,000 to 19,999,999,999[ edit ] 10,000,000,019 = smallest 11-digitprime number .[ 1] 10,000,020,331 = smallesttriangular number with 11 digits and the 141,421st triangular number10,123,457,689 = smallestpandigital prime in base 10.[ 2] 10,294,287,500 = 22 ×55 ×77 [ 3] 10,314,998,977 = number ofparallelogram polyominoes with 29 cells.[ 4] 10,460,353,203 = 21873 = 277 = 321 10,460,362,464 = Leyland number using 3 & 21 (321 + 213 )10,480,142,147 = 16thBell number .[ 5] 10,604,499,373 = 21973 = 139 10,779,215,329 = 1038232 = 22093 = 476 11,019,960,576 = 1049762 = 3244 = 188 11,111,111,111 =repunit 11,123,060,678 = number of free 21-ominoes11,874,568,703 = number of partitions of 378 into divisors of 378[ 6] 12,230,590,464 = 1105922 = 23043 = 486 12,345,654,321 = 1111112 , palindromic square12,586,269,025 = 50thFibonacci number .13,060,694,016 = 613 13,409,202,676 = number of 41-bead necklaces (turning over is allowed) where complements are equivalent[ 7] 13,492,928,512 = 287 13,743,921,632 = number of 40-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 8] 13,749,310,575 = double factorial of 2113,800,000,000 = approximate age of the universe in years[ 9] 13,841,287,201 = 1176492 = 24013 = 3434 = 496 = 712 13,893,615,154 = number of centered hydrocarbons with 32 carbon atoms[ 10] 13,967,553,600 =superior highly composite number ,[ 11] superabundant number [ 12] 14,182,439,040 = smallest5-perfect number [ 13] 14,499,777,100 – initial number of fifth centuryxx 00 toxx 99 containing exactly seventeenprime numbers (14,499,777,100+n , forn = 7, 9, 13, 19, 21, 33, 37, 43, 51, 61, 63, 67, 69, 79, 81, 91, 97)[ 14] 14,830,871,802 = number of trees with 30 unlabeled nodes[ 15] 15,552,771,085 = number of series-reduced planted trees with 39 nodes[ 16] 15,625,000,000 = 1250002 = 25003 = 506 16,481,146,479 = number of (unordered, unlabeled) rooted trimmed trees with 31 nodes[ 17] 16,983,563,041 = 1303212 = 3614 = 198 17,171,999,198 = number of partitions of 390 into divisors of 390[ 6] 17,179,869,184 = 1310722 = 417 = 234 17,179,870,340 =Leyland number [ 18] using 2 & 34 (234 + 342 )17,179,952,705 = Leyland number using 4 & 17 (417 + 174 )17,249,876,309 = 297 17,387,594,880 = position of first occurrence of the string 0123456789 in the decimal expansion ofπ [ 19] 17,589,157,530 = number of partitions of 288 into divisors of 288[ 6] 17,596,287,801 = 1326512 = 26013 = 516 18,212,890,625 = 1-automorphic number [ 20] 18,348,340,127 = logarithmic number.[ 21] 18,457,556,052 = 28thPell number .[ 22] 18,632,325,319 = 33rdWedderburn–Etherington number .[ 23] 19,577,194,573 = Markov prime19,606,122,418 = number of partitions of 384 into divisors of 384[ 6] 19,770,609,664 = 1406082 = 27043 = 526 19,847,520,789 = number of uniform rooted trees with 29 nodes[ 24] 20,000,000,000 to 29,999,999,999[ edit ] 20,365,011,074 = 51st Fibonacci number.20,661,046,784 = 27443 = 149 21,511,212,261 = number of secondary structures of RNA molecules with 30 nucleotides[ 25] 21,870,000,000 = 307 22,164,361,129 = 1574642 = 28093 = 536 22,222,222,222 =repdigit 22,801,763,489 = 1,000,000,000th prime number23,818,760,154 = number of parallelogram polyominoes with 30 cells.[ 4] 24,466,267,020 =Catalan number [ 26] 24,794,911,296 = 1574642 = 29163 = 546 25,209,506,681 = Markov prime25,600,000,000 = 1600002 = 4004 = 208 25,669,818,476 = 26thMotzkin number .[ 27] 25,937,424,601 = 1610512 = 1215 = 1110 26,179,922,024 = number of 42-bead necklaces (turning over is allowed) where complements are equivalent[ 7] 26,771,144,400 = smallest number divisible by the numbers from 1 to 26 (there is no smaller number divisible by the numbers from 1 to 25 since any number divisible by 2 and 13 must be divisible by 26)26,817,356,776 = number of 41-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 8] 26,990,077,184 = number of partitions of 240 into divisors of 240[ 6] 27,512,614,111 = 317 27,680,640,625 = 1663752 = 30253 = 556 28,088,787,314 = number of signed trees with 19 nodes[ 28] 28,843,094,837 = number of partitions of 300 into divisors of 300[ 6] 30,000,000,000 to 39,999,999,999[ edit ] 30,517,578,125 = 31253 = 1255 = 515 30,840,979,456 = 1756162 = 31363 = 566 31,381,059,609 = 1771472 = 911 = 322 31,381,070,257 = Leyland number using 3 & 22 (322 + 223 )32,742,002,341 = number of series-reduced planted trees with 40 nodes[ 16] 32,951,280,099 = 52nd Fibonacci number.33,333,333,333 = repdigit33,489,857,205 = number of prime numbers having twelve digits[ 29] 33,823,827,452 = number ofpartially ordered set with 13 unlabeled elements[ 30] 34,296,447,249 = 1851932 = 32493 = 576 34,359,738,368 = 1285 = 327 = 235 34,359,739,593 =Leyland number [ 18] using 2 & 35 (235 + 352 )36,201,693,122 = number of centered hydrocarbons with 33 carbon atoms[ 10] 37,607,912,018 = number of primes under 1012 37,822,859,361 = 1944812 = 4414 = 218 38,068,692,544 = 1951122 = 33643 = 586 38,443,359,375 = 33753 = 159 40,000,000,000 to 49,999,999,999[ edit ] 40,330,829,030 = number of trees with 31 unlabeled nodes[ 15] 40,849,449,618 = number of (unordered, unlabeled) rooted trimmed trees with 32 nodes[ 17] 42,180,533,641 = 2053792 = 34813 = 596 42,618,442,977 = 337 43,191,857,688 = number of free 22-ominoes44,208,781,349 = Markov prime44,214,569,100 = 34th Wedderburn–Etherington number.[ 23] 44,444,444,444 = repdigit44,560,482,149 = Markov prime, 29th Pell number[ 22] 46,656,000,000 = 2160002 = 36003 = 606 50,000,000,000 to 59,999,999,999[ edit ] 50,006,393,431 = smallest prime number in base 10 whose expansions is bases 2 to 9 are all valid decimal expansions of (other) primes[ 31] 51,001,180,160 = largest known[ 32] (and conjectured to be the largest)[ 33] triperfect number 51,141,124,287 = number of 43-bead necklaces (turning over is allowed) where complements are equivalent[ 7] 51,283,502,951 = number k such that the sum of the squares of the first k primes is divisible by k.[ 34] 51,520,374,361 = 2269812 = 37213 = 616 52,308,750,878 = number of uniform rooted trees with 30 nodes[ 24] 52,357,746,896 = number of 42-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 8] 52,495,396,602 = 7thprimary pseudoperfect number .[ 35] 52,523,350,144 = 347 53,316,291,173 = 53rd Fibonacci number.53,745,962,199 = number of secondary structures of RNA molecules with 31 nucleotides[ 25] 54,875,873,536 = 2342562 = 4844 = 228 55,000,815,222 = number of parallelogram polyominoes with 31 cells.[ 4] 55,420,693,056 = 8th square triangular number.55,555,555,555 = repdigit56,800,235,584 = 2383282 = 38443 = 626 60,000,000,000 to 69,999,999,999[ edit ] 61,917,364,224 = 2488322 = 1445 = 1210 62,523,502,209 = 2500472 = 39693 = 636 64,339,296,875 = 357 65,118,683,800 – initial number of sixth centuryxx 00 toxx 99 containing exactly seventeen prime numbers (65,118,683,800+n , forn = 3, 7, 9, 13, 37, 43, 49, 57, 63, 67, 79, 81, 87, 91, 93, 97, 99)[ 14] 66,666,666,666 = repdigit68,719,476,736 = 2621442 = 40963 = 5124 = 646 = 169 = 812 = 418 = 236 68,719,478,032 =Leyland number [ 18] using 2 & 36 (236 + 362 )68,719,581,712 = Leyland number using 4 & 18 (418 + 184 )68,998,193,212 = number of series-reduced planted trees with 41 nodes[ 16] 69,486,440,625 = 33 ×55 ×77 [ 3] 70,000,000,000 to 79,999,999,999[ edit ] 73,007,772,802 = 27th Motzkin number.[ 27] 75,418,890,625 = 2746252 = 42253 = 656 77,777,777,777 = repdigit78,310,985,281 = 2798412 = 5294 = 238 78,364,164,096 = 2799362 = 367 = 614 80,000,000,000 to 89,999,999,999[ edit ] 80,313,433,200 =highly composite number , smallest number divisible by the numbers from 1 to 2881,393,657,019 = 14thalternating factorial .[ 36] 81,749,606,400 = double factorial of 2281,787,109,376 = 1-automorphic number [ 20] 82,653,950,016 = 2874962 = 43563 = 666 82,864,869,804 = 17th Bell number.[ 5] 86,267,571,272 = 54th Fibonacci number.87,178,291,199 =factorial prime [ 37] 87,178,291,200 = 14! 88,888,888,888 = repdigit 90,000,000,000 to 99,999,999,999[ edit ] 90,458,382,169 = 3007632 = 44893 = 676 91,482,563,640 = Catalan number[ 26] 94,143,178,827 = 323 94,143,190,994 = Leyland number using 3 & 23 (323 + 233 )94,550,040,702 = number of centered hydrocarbons with 34 carbon atoms[ 10] 94,931,877,133 = 377 96,889,010,407 = 713 98,867,482,624 = 3144322 = 46243 = 686 99,957,747,388 = number of 44-bead necklaces (turning over is allowed) where complements are equivalent[ 7] 99,999,999,977 = largest 11-digit prime number[ 38] 99,999,999,999 = largest 11-digit number, repdigit^ Sloane, N. J. A. (ed.)."Sequence A003617 (Smallest n-digit prime)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A050288 (Pandigital primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b 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.^a b c Sloane, 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.^a b Sloane, N. J. A. (ed.)."Sequence A000110 (Bell or exponential numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c d e f Sloane, N. J. A. (ed.)."Sequence A018818 (Number of partitions of n into divisors of n)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c d Sloane, 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.^a b c Sloane, 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.^ Cooper, Keith (August 28, 2023)."How Old is the Universe?" .Space.com . Retrieved2025-02-18 . ^a b c Sloane, 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 A002201 (Superior highly composite numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A004394 (Superabundant [or super-abundant] numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A007539 (first n-fold perfect (or n-multiperfect) number)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A186509 (Centuries containing 17 primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A000055 (Number of trees with n unlabeled nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c Sloane, N. J. A. (ed.)."Sequence A001678 (Number of series-reduced planted trees with n nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c Sloane, N. J. A. (ed.)."Sequence A076980 (Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A101815 (Positions in the decimal places of Pi where the string of digits 0123456789 appears)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b 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 A002104 (Logarithmic numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A000129 (Pell numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A001190 (Wedderburn-Etherington numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A317712 (Number of uniform rooted trees with n nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A004148 (Generalized Catalan numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A000108 (Catalan numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A001006 (Motzkin numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A000060 (Number of signed trees with n nodes)" .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 A000112 (Number of partially ordered sets (posets) with n unlabeled elements)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Brennen, Jack."Puzzle 24. – Primes in several bases" .primepuzzles.net . ^ Sloane, N. J. A. (ed.)."Sequence A005820 (3-perfect (triply perfect, tri-perfect, triperfect orsous-double ) numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Flammenkamp, Achim."The Multiply Perfect Numbers Page" . ^ Sloane, N. J. A. (ed.)."Sequence A111441 (Numbers k such that the sum of the squares of the first k primes is divisible by k)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A054377 (Primary pseudoperfect numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A005165 (Alternating factorials)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A088054 (Factorial primes)" .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