10,000,000,000
Appearance
![]() | This article or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this article or section has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This article was last edited by 92.99.60.39 (talk | contribs) 6 hours ago. (Update timer) |
10000000000 | |
---|---|
Cardinal | Ten billion |
Ordinal | Ten billionth (short scale) |
Factorization |
|
Greek numeral | |
Roman numeral | X |
Binary | 10010101000000101111100100000000002 |
Ternary | 2212102202021220101013 |
Senary | 43321424121446 |
Octal | 1124027620008 |
Duodecimal | 1B30B9105412 |
Hexadecimal | 2540BE40016 |
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,460,353,203 = 21873 = 277 = 321
- 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[3]
- 12,586,269,025 = 50th Fibonacci number.
- 13,060,694,016 = 613
- 13,820,000,000 = approximate age of the universe in years[4]
- 13,841,287,201 = 1176492 = 24013 = 3434 = 496 = 712
- 13,967,553,600 = superior highly composite number,[5] superabundant number[6]
- 14,830,871,802 = number of trees with 30 unlabeled nodes[7]
- 16,983,563,041 = 1303212 = 3614 = 198
- 17,171,999,198 = number of partitions of 390 into divisors of 390[3]
- 17,179,869,184 = 1310722 = 417 = 234
- 17,589,157,530 = number of partitions of 288 into divisors of 288[3]
- 18,212,890,625 = 1-automorphic number[8]
- 19,606,122,418 = number of partitions of 384 into divisors of 384[3]
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
- 25,600,000,000 = 1600002 = 4004 = 208
- 25,937,424,601 = 1610512 = 1215 = 1110
- 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,990,077,184 = number of partitions of 240 into divisors of 240[3]
- 28,843,094,837 = number of partitions of 300 into divisors of 300[3]
30,000,000,000 to 39,999,999,999
[edit]- 30,517,578,125 = 31253 = 1255 = 515
- 31,381,059,609 = 1771472 = 911 = 322
- 32,951,280,099 = 52nd Fibonacci number.
- 33,333,333,333 = repdigit
- 34,359,738,368 = 1285 = 327 = 235
- 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[7]
- 43,191,857,688 = number of free 22-ominoes
- 44,444,444,444 = repdigit
50,000,000,000 to 59,999,999,999
[edit]- 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
70,000,000,000 to 79,999,999,999
[edit]- 77,777,777,777 = repdigit
- 78,364,164,096 = 2799362 = 367 = 614
80,000,000,000 to 89,999,999,999
[edit]- 81,787,109,376 = 1-automorphic number[8]
- 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]- 94,143,178,827 = 323
- 96,889,010,407 = 713
- 99,999,999,999 = repdigit
References
[edit]- ^ Sloane, N. J. A. (ed.). "Sequence A003617 (Smallest n-digit prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A050288 (Pandigital primes)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ updated, Keith Cooper last (2017-06-08). "How Old is the Universe?". Space.com. Retrieved 2025-02-18.
- ^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A004394 (Superabundant [or super-abundant] numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ 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.
- ^ 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.