1,000,000,000

Source: Wikipedia, the free encyclopedia.
1000000000
CardinalOne billion (short scale)
One thousand million, or one milliard (long scale)
OrdinalOne billionth (short scale)
Factorization
  • 29
  • 59
Greek numeral
Roman numeralM
Binary1110111001101011001010000000002
Ternary21202002000210100013
Senary2431212453446
Octal73465450008
Duodecimal23AA9385412
Hexadecimal3B9ACA0016

1,000,000,000 (one

short scale; one thousand million or one milliard, one yard,[1] long scale) is the natural number following 999,999,999 and preceding 1,000,000,001. With a number, "billion" can be abbreviated as b, bil[citation needed] or bn.[2][3]

In standard form, it is written as 1 × 109. The

giga indicates 1,000,000,000 times the base unit. Its symbol is G
.

One billion years may be called an eon in astronomy or geology.

Previously in British English (but not in American English), the word "billion" referred exclusively to a million millions (1,000,000,000,000). However, this is not common anymore, and the word has been used to mean one thousand million (1,000,000,000) for several decades.[4]

The term milliard could also be used to refer to 1,000,000,000; whereas "milliard" is rarely used in English,[5] variations on this name often appear in other languages.

In the

arab
.

1,000,000,000 is also the cube of 1000.

Visualization of powers of ten from one to 1 billion

Sense of scale

The facts below give a sense of how large 1,000,000,000 (109) is in the context of time according to current scientific evidence:

Time

Distance

  • 109 inches is 15,783 miles (25,400 km), more than halfway around the world and thus sufficient to reach any point on the globe from any other point.
  • 109
    gigametre) is almost three times the distance from the Earth to the Moon
    .
  • 109
    terametre) is over six times the distance from the Earth to the Sun
    .

Area

  • A billion square inches could make a square about one half mile on a side.
  • A bolt of finely woven
    1000-TC
    bed sheet linen with a billion thread crossings would have an area of 40 square metres (48 sq yd), comparable to the floor area of a motel unit.

Volume

  • There are one billion cubic
    cubic kilometre
    .
  • A billion grains of table salt or granulated sugar would occupy a volume of about 2.5 cubic feet (0.071 m3).
  • A billion cubic inches would be a volume comparable to a large commercial building slightly larger than a typical supermarket.

Weight

Products

Nature

  • A small mountain, slightly larger than Stone Mountain in Georgia, United States, would weigh (have a mass of) a billion tons.
  • There are billions of worker ants in the largest ant colony in the world,[9] which covers almost 4,000 miles (6,400 km) of the Mediterranean coast.
  • In 1804, the world population was one billion.

Count

A is a cube; B consists of 1000 cubes the size of cube A, C consists of 1000 cubes the size of cube B; and D consists of 1000 cubes the size of cube C. Thus there are 1 million A-sized cubes in C; and 1,000,000,000 A-sized cubes in D.

Selected 10-digit numbers (1,000,000,001–9,999,999,999)

1,000,000,001 to 1,999,999,999

  • 1,000,000,007 : smallest prime number with 10 digits.[10]
  • 1,000,006,281 : smallest triangular number with 10 digits and the 44,721st triangular number.
  • 1,000,014,129 = 316232, the smallest ten-digit square.
  • 1,003,003,001 = 10013, palindromic cube
  • 1,023,456,789 : smallest pandigital number in decimal.[11]
  • 1,026,753,849 = 320432, the smallest pandigital square in base 10.
  • 1,069,863,695 = number of square (0,1)-matrices without zero rows and with exactly 9 entries equal to 1[12]
  • 1,073,741,824 = 327682 = 10243 = 645 = 326 = 810 = 415 = 230
  • 1,073,742,724 : Leyland number
  • 1,073,792,449 : Leyland number
  • 1,093,104,961 = number of (unordered, unlabeled) rooted trimmed trees with 28 nodes[13]
  • 1,104,891,746 = number of partially ordered set with 12 unlabeled elements[14]
  • 1,111,111,111 : repunit, also a special number relating to the passing of Unix time.
  • 1,129,760,415 = 23rd Motzkin number.[15]
  • 1,134,903,170 = 45th
    Fibonacci number
    .
  • 1,139,733,677 : number k such that the sum of the squares of the first k primes is divisible by k.[16]
  • 1,160,290,625 = 655
  • 1,162,261,467 = 319
  • 1,162,268,326 : Leyland number
  • 1,166,732,814 = number of signed trees with 17 nodes[17]
  • 1,173,741,824 : Leyland number
  • 1,220,703,125 = 513
  • 1,221,074,418 : Leyland number
  • 1,232,922,769 : Centered hexagonal number.
  • 1,234,567,890 : pandigital number with the digits in order.
  • 1,252,332,576 = 665
  • 1,280,000,000 = 207
  • 1,291,467,969 = 359372 = 10893 = 336
  • 1,311,738,121 : 25th Pell number.[18]
  • 1,350,125,107 = 675
  • 1,382,958,545 : 15th Bell number.[19]
  • 1,392,251,012 : number of secondary structures of RNA molecules with 27 nucleotides[20]
  • 1,405,695,061 : Markov prime
  • 1,406,818,759 : 30th Wedderburn–Etherington number.[21]
  • 1,421,542,641 : logarithmic number.[22]
  • 1,425,893,465 = Population of the
    People's Republic of China in 2018.[23][24]
  • 1,453,933,568 = 685
  • 1,464,407,113 : number of series-reduced trees with 39 nodes[25]
  • 1,466,439,680 : number of independent vertex sets and vertex covers in the 21-sunlet graph[26]
  • 1,475,789,056 = 384162 = 1964 = 148
  • 1,528,823,808 = 11523
  • 1,533,776,805 : pentagonal triangular number
  • 1,544,804,416 = 393042 = 11563 = 346
  • 1,564,031,349 = 695
  • 1,606,879,040 : Dowling number[27]
  • 1,631,432,881 = 403912, square triangular number
  • 1,661,392,258 : n such that n divides (3n + 5)[28]
  • 1,673,196,525 : Least common multiple of the odd integers from 1 to 25
  • 1,677,922,740 : number of series-reduced planted trees with 36 nodes[29]
  • 1,680,700,000 = 705
  • 1,755,206,648 : coefficient of a ménage hit polynomial[30]
  • 1,767,263,190 = [31]
  • 1,787,109,376 : 1-automorphic number[32]
  • 1,801,088,541 = 217
  • 1,804,229,351 = 715
  • 1,808,141,741 : number of partitions of 280 into divisors of 280[33]
  • 1,808,676,326 : number of 38-bead necklaces (turning over is allowed) where complements are equivalent[34]
  • 1,836,311,903 : 46th Fibonacci number.
  • 1,838,265,625 = 428752 = 12253 = 356
  • 1,848,549,332 : number of partitions of 270 into divisors of 270[33]
  • 1,857,283,156 : number of 37-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[35]
  • 1,882,341,361 : The smallest prime whose reversal is a square triangular number (triangular of 57121).
  • 1,934,917,632 = 725
  • 1,934,502,740 : number of parallelogram polyominoes with 27 cells.[36]
  • 1,996,813,914 : Leyland number
  • 1,977,326,743 = 711
  • 1,921,525,212 : number of partitions of 264 into divisors of 264[33]

2,000,000,000 to 2,999,999,999

  • 2,023,443,032 = number of trees with 28 unlabeled nodes[37]
  • 2,038,074,743 = 100,000,000th prime number
  • 2,062,142,876 = number of centered hydrocarbons with 30 carbon atoms[38]
  • 2,073,071,593 = 735
  • 2,082,061,899 = multiplicative inverse of 40,014 modulo 2,147,483,563
  • 2,147,483,563 = prime number, used as the modulus for the combined linear congruential generator
  • bit
    integer.
  • 2,147,483,648 = 231
  • 2,147,484,609 = Leyland number
  • 2,176,782,336 = 466562 = 12963 = 2164 = 366 = 612
  • 2,179,768,320 = Leyland number
  • 2,214,502,422 = 6th primary pseudoperfect number.[39]
  • 2,219,006,624 = 745
  • 2,222,222,222 = repdigit
  • 2,276,423,485 = number of ways to partition {1,2,...,12} and then partition each cell (block) into subcells.[40]
  • 2,333,606,816 = [41]
  • 2,357,947,691 = 13313 = 119
  • 2,373,046,875 = 755
  • 2,494,357,888 = 227
  • 2,521,008,887 = 4th Mills' prime
  • 2,535,525,376 = 765
  • 2,562,890,625 = 506252 = 2254 = 158
  • 2,565,726,409 = 506532 = 13693 = 376
  • 2,573,571,875 = 55×77[42]
  • 2,695,730,992 = number of (unordered, unlabeled) rooted trimmed trees with 29 nodes[13]
  • 2,706,784,157 = 775
  • 2,873,403,980 = number of uniform rooted trees with 27 nodes[43]
  • 2,834,510,744 = number of nonequivalent dissections of an 22-gon into 19 polygons by nonintersecting diagonals up to rotation[44]
  • 2,887,174,368 = 785
  • 2,971,215,073 = 11th Fibonacci prime (47th Fibonacci number) and a Markov prime.

3,000,000,000 to 3,999,999,999

  • 3,010,936,384 = 548722 = 14443 = 386
  • 3,077,056,399 = 795
  • 3,166,815,962 = 26th Pell number.[18]
  • 3,192,727,797 = 24th Motzkin number.[15]
  • 3,276,800,000 = 805
  • 3,323,236,238 = 31st Wedderburn–Etherington number.[21]
  • 3,333,333,333 = repdigit
  • 3,404,825,447 = 237
  • 3,405,691,582 = hexadecimal CAFEBABE; used as a placeholder in programming.
  • 3,405,697,037 = hexadecimal CAFED00D; used as a placeholder in programming.
  • 3,461,824,644 = number of secondary structures of RNA molecules with 28 nucleotides[20]
  • 3,486,784,401 = 590492 = 2434 = 815 = 910 = 320
  • 3,486,792,401 = Leyland number
  • 3,492,564,909 = 12+34+56+78+910[45]
  • 3,518,743,761 = 593192 = 15213 = 396
  • 3,520,581,954 = number of series-reduced planted trees with 37 nodes[29]
  • 3,524,337,980 = number of 39-bead necklaces (turning over is allowed) where complements are equivalent[34]
  • 3,616,828,364 = number of 38-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[35]
  • 3,663,002,302 = number of prime numbers having eleven digits[46]
  • 3,665,821,697 = 437 × 223 + 1; smallest Proth prime for k = 437
  • 3,697,909,056 = number of primitive polynomials of degree 37 over GF(2)[47]
  • 3,707,398,432 = 825
  • 3,715,891,200 = double factorial of 20
  • 3,735,928,559 = hexadecimal DEADBEEF; used as a placeholder in programming.
  • 3,735,929,054 = hexadecimal DEADC0DE; used as a placeholder in programming.
  • 3,816,547,290 = 10 digit polydivisble number
  • 3,939,040,643 = 835

4,000,000,000 to 4,999,999,999

  • 4,006,387,712 = number of independent vertex sets and vertex covers in the 22-sunlet graph[26]
  • 4,021,227,877 = least k >= 1 such that the remainder when 6k is divided by k is 5[48]
  • 4,096,000,000 = 640002 = 16003 = 406
  • 4,118,054,813 = number of primes under 1011
  • 4,182,119,424 = 845
  • 4,294,967,291 = Largest prime 32-bit unsigned integer.
  • Fermat primes
    through .
  • 4,294,967,296 = 655362 = 2564 = 168 = 416 = 232
  • 4,294,967,297 = , the first composite Fermat number.
  • 4,294,968,320 = Leyland number
  • 4,295,032,832 = Leyland number
  • 4,437,053,125 = 855
  • 4,444,444,444 = repdigit
  • 4,467,033,943 – number of parallelogram polyominoes with 28 cells.[36]
  • 4,486,784,401 = Leyland number
  • 4,500,000,000 = Approximate age of the Earth in years
  • 4,586,471,424 = 247
  • 4,700,063,497 = smallest number n > 1 such that 2n is congruent to 3 (mod n)[49]
  • 4,704,270,176 = 865
  • 4,750,104,241 = 689212 = 16813 = 416
  • 4,807,526,976 = 48th Fibonacci number.
  • 4,984,209,207 = 875

5,000,000,000 to 5,999,999,999

  • 5,159,780,352 = 17283 = 129 = 1,000,000,00012 AKA a great-great-great-gross (1,000,00012 great-grosses or 100012 great-great-grosses)
  • 5,277,319,168 = 885
  • 5,345,531,935 = number of centered hydrocarbons with 31 carbon atoms[38]
  • 5,354,228,880 = superior highly composite number, smallest number divisible by all the numbers 1 through 24
  • 5,391,411,025 = smallest odd abundant number not divisible by 3[50]
  • 5,469,566,585 = number of trees with 29 unlabeled nodes[51]
  • 5,489,031,744 = 740882 = 17643 = 426
  • 5,555,555,555 = repdigit
  • 5,584,059,449 = 895
  • 5,702,046,382 = number of signed trees with 18 nodes[52]
  • 5,726,623,061 = 101010101010101010101010101010101 in binary
  • 5,784,634,181 = 13th alternating factorial.[53]
  • 5,904,900,000 = 905

6,000,000,000 to 6,999,999,999

  • 6,103,515,625 = 781252 = 257 = 514
  • 6,104,053,449 = Leyland number
  • 6,210,001,000 = only self-descriptive number in base 10.
  • 6,227,020,800 = 13!
  • 6,240,321,451 = 915
  • 6,321,363,049 = 795072 = 18493 = 436
  • 6,469,693,230 = tenth primorial
  • 6,564,120,420 = , where is the th Catalan number.[31]
  • 6,590,815,232 = 925
  • 6,659,914,175 = number of (unordered, unlabeled) rooted trimmed trees with 30 nodes[13]
  • 6,666,666,666 = repdigit
  • 6,956,883,693 = 935
  • 6,975,757,441 = 835212 = 2894 = 178
  • 6,983,776,800 = 15th colossally abundant number,[54] 15th superior highly composite number[55]

7,000,000,000 to 7,999,999,999

  • 7,007,009,909 = smallest number in base 10 to take 100 iterations to form a palindrome[56]
  • 7,048,151,672 = number of 39-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[35]
  • 7,256,313,856 = 851842 = 19363 = 446
  • 7,339,040,224 = 945
  • 7,371,308,068 = number of partitions of 252 into divisors of 252[33]
  • 7,391,026,522 = number of planar partitions of 49[57]
  • 7,464,000,000 = Estimated population of the Earth in 2016 according to Worldometers[58]
  • 7,544,428,973 = number of uniform rooted trees with 28 nodes[43]
  • 7,645,370,045 = 27th Pell number.[18]
  • 7,737,809,375 = 955
  • 7,777,777,777 = repdigit
  • 7,778,742,049 = 49th Fibonacci number.
  • 7,795,000,000 = Estimated population of the Earth in 2020 according to Worldometers[58]
  • 7,862,958,391 = 32nd Wedderburn–Etherington number.[21]

8,000,000,000 to 8,999,999,999

  • 8,031,810,176 = 267
  • 8,153,726,976 = 965
  • 8,212,890,625 = 1-automorphic number[32]
  • 8,303,765,625 = 911252 = 20253 = 456
  • 8,549,176,320 = pandigital number with the digits arranged in alphabetical order by English name
  • 8,587,340,257 = 975
  • 8,589,866,963 = number of subsets of {1,2,...,33} with relatively prime elements[59]
  • 8,589,869,056 = 6th perfect number.[60]
  • 8,589,934,592 = 20483 = 811 = 233
  • 8,589,935,681 = Leyland prime
  • 8,622,571,758 = number of secondary structures of RNA molecules with 29 nucleotides[20]
  • 8,804,293,473 = Leyland number
  • 8,888,888,888 = repdigit

9,000,000,000 to 9,999,999,999

  • 9,039,207,968 = 985
  • 9,043,402,501 = 25th Motzkin number.[15]
  • 9,393,931,000 = 21103
  • 9,474,296,896 = 973362 = 21163 = 466
  • 9,509,900,499 = 995
  • 9,814,072,356 = 990662, the largest
    pandigital square
    , largest pandigital pure power.
  • 9,876,543,210 = largest number without repeated digits in base 10.
  • 9,999,800,001 = 999992, the largest ten-digit square.
  • 9,999,999,967 = greatest prime number with 10 digits[61]
  • 9,999,999,999 = largest 10-digit number, repdigit

References

  1. ^ "Yard". Investopedia. Retrieved 13 November 2017.
  2. .
  3. ^ "6.5 Abbreviating 'million' and 'billion'". English Style Guide: A handbook for authors and translators in the European Commission (PDF) (8th ed.). European Commission. 3 November 2017. p. 32.
  4. OxfordDictionaries.com. Archived from the original
    on January 12, 2017. Retrieved 13 November 2017.
  5. ^ "billion,thousand million,milliard". Google Ngram Viewer. Retrieved 13 November 2017.
  6. ^ "Cosmic Detectives". European Space Agency. 2 April 2013.
  7. ^ Panken, Eli (27 July 2016). "Apple Announces It Has Sold One Billion iPhones". NBCNews.com. Retrieved 22 April 2023.
  8. ^ Seethamaram, Deep (27 July 2016). "Facebook Posts Strong Profit and Revenue Growth". The Wall Street Journal. Retrieved 13 November 2017.
  9. ^ Burke, Jeremy (16 June 2015). "How the World Became A Giant Ant Colony". Atlas Obscura. Retrieved 13 November 2017.
  10. ^ Sloane, N. J. A. (ed.). "Sequence A003617 (Smallest n-digit prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A049363 (a(1) = 1; for n > 1, smallest digitally balanced number in base n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^ Sloane, N. J. A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^ a b c Sloane, N. J. A. (ed.). "Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ^ 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.
  15. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^ a b c Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. ^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^ a b c Sloane, N. J. A. (ed.). "Sequence A004148 (Generalized Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^ Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ^ "World Population Prospects 2022". United Nations Department of Economic and Social Affairs, Population Division. Retrieved July 17, 2022.
  24. ^ "World Population Prospects 2022: Demographic indicators by region, subregion and country, annually for 1950-2100" (XSLX) ("Total Population, as of 1 July (thousands)"). United Nations Department of Economic and Social Affairs, Population Division. Retrieved July 17, 2022.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. ^ a b Sloane, N. J. A. (ed.). "Sequence A080040 (2*a(n-1) + 2*a(n-2) for n > 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ^ Sloane, N. J. A. (ed.). "Sequence A007405 (Dowling numbers: e.g.f.: exp(x + (exp(b*x) - 1)/b) with b=2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  28. ^ Sloane, N. J. A. (ed.). "Sequence A277288 (Positive integers n such that n divides (3^n + 5))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  29. ^ a b Sloane, N. J. A. (ed.). "Sequence A001678 (Number of series-reduced planted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  30. ^ Sloane, N. J. A. (ed.). "Sequence A000033 (Coefficients of ménage hit polynomials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ^ a b Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers: (2n)!/(n!(n+1)!))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. ^ a b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  33. ^ a b c d 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.
  34. ^ a b 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.
  35. ^ 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.
  36. ^ a b Sloane, N. J. A. (ed.). "Sequence A006958 (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.
  37. ^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  38. ^ a b Sloane, N. J. A. (ed.). "Sequence A000022 (Number of centered hydrocarbons with n atoms)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  39. ^ Sloane, N. J. A. (ed.). "Sequence A054377 (Primary pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  40. ^ Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A056045 (Sum_{d divides n} binomial(n,d))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ^ 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.
  43. ^ a b Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. ^ Sloane, N. J. A. (ed.). "Sequence A220881 (Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  45. ^ Sloane, N. J. A. (ed.). "Sequence A318868 (a(n) = 1^2 + 3^4 + 5^6 + 7^8 + 9^10 + 11^12 + 13^14 + ... + (up to n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  46. ^ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  47. ^ Sloane, N. J. A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. ^ Sloane, N. J. A. (ed.). "Sequence A127816 (least k such that the remainder when 6^k is divided by k is n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  49. ^ Sloane, N. J. A. (ed.). "Sequence A050259 (Numbers n such that 2^n == 3 (mod n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. ^ Sloane, N. J. A. (ed.). "Sequence A115414 (Odd abundant numbers not divisible by 3.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. ^ Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  56. ^ "Reversal-Addition Palindrome Test on 7007009909". July 9, 2021.
  57. ^ Sloane, N. J. A. (ed.). "Sequence A000219 (Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  58. ^ a b "World Population by Year". January 1, 2017.
  59. ^ Sloane, N. J. A. (ed.). "Sequence A085945 (Number of subsets of {1,2,...,n} with relatively prime elements)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  60. ^ Sloane, N. J. A. (ed.). "Sequence A000396 (Perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  61. Wolfram Alpha
    . Retrieved 13 November 2017.