Jump to content

10,000,000,000

From Wikipedia, the free encyclopedia
10000000000
CardinalTen billion
OrdinalTen billionth (short scale)
Factorization
  • 210
  • 510
Greek numeral
Roman numeralX
Binary10010101000000101111100100000000002
Ternary2212102202021220101013
Senary43321424121446
Octal1124027620008
Duodecimal1B30B9105412
Hexadecimal2540BE40016

10,000,000,000 (ten billion) is the natural number following 9,999,999,999 and preceding 10,000,000,001.

In scientific notation, it is written as 1010.

10,000,000,000 is also the fifth power of 100 and also the square of 100,000.

Selected 11-digit numbers (10,000,000,001–99,999,999,999)

[edit]

10,000,000,001 to 19,999,999,999

[edit]
  • 10,000,000,019 = smallest 11-digit prime number.[1]
  • 10,000,020,331 = smallest triangular number with 11 digits and the 141,421st triangular number
  • 10,123,457,689 = smallest pandigital prime in base 10.[2]
  • 10,294,287,500 = 22×55×77[3]
  • 10,460,353,203 = 21873 = 277 = 321
  • 10,460,362,464 = Leyland number using 3 & 21 (321 + 213)
  • 10,480,142,147 = 16th Bell number.[4]
  • 10,604,499,373 = 21973 = 139
  • 11,019,960,576 = 1049762 = 3244 = 188
  • 11,111,111,111 = repunit
  • 11,123,060,678 = number of free 21-ominoes
  • 11,874,568,703 = number of partitions of 378 into divisors of 378[5]
  • 12,345,654,321 = 1111112, palindromic square
  • 12,586,269,025 = 50th Fibonacci number.
  • 13,060,694,016 = 613
  • 13,409,202,676 = number of 41-bead necklaces (turning over is allowed) where complements are equivalent[6]
  • 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[7]
  • 13,749,310,575 = double factorial of 21
  • 13,820,000,000 = approximate age of the universe in years[8]
  • 13,841,287,201 = 1176492 = 24013 = 3434 = 496 = 712
  • 13,967,553,600 = superior highly composite number,[9] superabundant number[10]
  • 14,830,871,802 = number of trees with 30 unlabeled nodes[11]
  • 16,983,563,041 = 1303212 = 3614 = 198
  • 17,171,999,198 = number of partitions of 390 into divisors of 390[5]
  • 17,179,869,184 = 1310722 = 417 = 234
  • 17,179,870,340 = Leyland number[12] using 2 & 34 (234 + 342)
  • 17,179,952,705 = Leyland number using 4 & 17 (417 + 174)
  • 17,589,157,530 = number of partitions of 288 into divisors of 288[5]
  • 18,212,890,625 = 1-automorphic number[13]
  • 18,348,340,127 = logarithmic number.[14]
  • 18,457,556,052 = 28th Pell number.[15]
  • 19,577,194,573 = Markov prime
  • 19,606,122,418 = number of partitions of 384 into divisors of 384[5]

20,000,000,000 to 29,999,999,999

[edit]
  • 20,365,011,074 = 51st Fibonacci number.
  • 20,661,046,784 = 27443 = 149
  • 22,222,222,222 = repdigit
  • 22,801,763,489 = 1,000,000,000th prime number
  • 24,466,267,020 = Catalan number[16]
  • 25,209,506,681 = Markov prime
  • 25,600,000,000 = 1600002 = 4004 = 208
  • 25,669,818,476 = 26th Motzkin number.[17]
  • 25,937,424,601 = 1610512 = 1215 = 1110
  • 26,179,922,024 = number of 42-bead necklaces (turning over is allowed) where complements are equivalent[6]
  • 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[7]
  • 26,990,077,184 = number of partitions of 240 into divisors of 240[5]
  • 28,843,094,837 = number of partitions of 300 into divisors of 300[5]

30,000,000,000 to 39,999,999,999

[edit]
  • 30,517,578,125 = 31253 = 1255 = 515
  • 31,381,059,609 = 1771472 = 911 = 322
  • 31,381,070,257 = Leyland number using 3 & 22 (322 + 223)
  • 32,951,280,099 = 52nd Fibonacci number.
  • 33,333,333,333 = repdigit
  • 33,489,857,205 = number of prime numbers having twelve digits[18]
  • 33,823,827,452 = number of partially ordered set with 13 unlabeled elements[19]
  • 34,359,738,368 = 1285 = 327 = 235
  • 34,359,739,593 = Leyland number[12] using 2 & 35 (235 + 352)
  • 37,607,912,018 = number of primes under 1012
  • 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[11]
  • 43,191,857,688 = number of free 22-ominoes
  • 44,208,781,349 = Markov prime
  • 44,444,444,444 = repdigit
  • 44,560,482,149 = Markov prime, 29th Pell number[15]

50,000,000,000 to 59,999,999,999

[edit]
  • 51,141,124,287 = number of 43-bead necklaces (turning over is allowed) where complements are equivalent[6]
  • 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[7]
  • 53,316,291,173 = 53rd Fibonacci number.
  • 55,420,693,056 = 8th square triangular number.
  • 55,555,555,555 = repdigit

60,000,000,000 to 69,999,999,999

[edit]
  • 61,917,364,224 = 2488322 = 1445 = 1210
  • 66,666,666,666 = repdigit
  • 68,719,476,736 = 2621442 = 40963 = 5124 = 646 = 169 = 812 = 418 = 236
  • 68,719,478,032 = Leyland number[12] using 2 & 36 (236 + 362)
  • 68,719,581,712 = Leyland number using 4 & 18 (418 + 184)
  • 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.[17]
  • 77,777,777,777 = repdigit
  • 78,364,164,096 = 2799362 = 367 = 614

80,000,000,000 to 89,999,999,999

[edit]
  • 80,313,433,200 = smallest number divisible by the numbers from 1 to 28
  • 81,393,657,019 = 14th alternating factorial.[20]
  • 81,749,606,400 = double factorial of 22
  • 81,787,109,376 = 1-automorphic number[13]
  • 82,864,869,804 = 17th Bell number.[4]
  • 86,267,571,272 = 54th Fibonacci number.
  • 87,178,291,200 = 14!
  • 88,888,888,888 = repdigit

90,000,000,000 to 99,999,999,999

[edit]
  • 91,482,563,640 = Catalan number[16]
  • 94,143,178,827 = 323
  • 94,143,190,994 = Leyland number using 3 & 23 (323 + 233)
  • 96,889,010,407 = 713
  • 99,957,747,388 = number of 44-bead necklaces (turning over is allowed) where complements are equivalent[6]
  • 99,999,999,977 = largest 11-digit prime number[21]
  • 99,999,999,999 = repdigit

References

[edit]
  1. ^ Sloane, N. J. A. (ed.). "Sequence A003617 (Smallest n-digit prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A050288 (Pandigital primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ a b Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A018818 (Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^ updated, Keith Cooper last (2017-06-08). "How Old is the Universe?". Space.com. Retrieved 2025-02-18.
  9. ^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^ Sloane, N. J. A. (ed.). "Sequence A004394 (Superabundant [or super-abundant] numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  11. ^ a b Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^ 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)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^ a b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers: m^2 ends with m.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ^ Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  15. ^ a b Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. ^ a b Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ a b Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. ^ Sloane, N. J. A. (ed.). "Sequence A000112 (Number of partially ordered sets (posets) with n unlabeled elements)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^ Sloane, N. J. A. (ed.). "Sequence A003618 (Largest n-digit prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Retrieved from "https://en.wikipedia.org/w/index.php?title=10,000,000,000&oldid=1279981426"