Natural number
1,000,000,000 ("onebillion " on theshort scale ; "one milliard" on thelong scale ; one thousand million) is thenatural number following999,999,999 and preceding 1,000,000,001. With a number, "billion" can be abbreviated asb ,bil [ 1] orbn .[ 2] [ 3]
In standard form, it is written as1 × 109 . Themetric prefix giga indicates 1,000,000,000 times the base unit. Its symbol isG .
One billion years may be called aneon in astronomy or geology.
Previously inBritish English (but not inAmerican English ), the word "billion" referred exclusively to amillion 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 termmilliard 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 inother languages .
In theIndian numbering system , it is known as 100crore or 1arab .
1,000,000,000 is also thecube of1000 .
It is a common metric used inmacroeconomics when describing national economies.
Visualization of powers of ten from one to 1 billion 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:
109 seconds (1 gigasecond) equal 11,574 days, 1 hour, 46 minutes and 40 seconds (approximately 31.7 years, or 31 years, 8 months, 8 days). About 109 minutes ago, theRoman Empire was flourishing and Christianity was emerging. (109 minutes is roughly 1,901 years.) About 109 hours ago, modern human beings and their ancestors were living in theStone Age (more precisely, theMiddle Paleolithic ). (109 hours is roughly 114,080 years.) About 109 days ago,Australopithecus , an ape-like creature related to an ancestor of modern humans, roamed the Africansavannas . (109 days is roughly2.738 million years.) About 109 months ago,dinosaurs walked the Earth during the lateCretaceous . (109 months is roughly83.3 million years.) About 109 years—agigaannus —ago, the firstmulticellular eukaryotes appeared on Earth. About 109 decades ago, thethin disk of theMilky Way started to form. (109 decades is exactly10 billion years.) Theuniverse is thought to be about13.8 × 109 years old. [ 6] 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 metres (called agigametre ) is almost three times the distance from theEarth to theMoon . 109 kilometres (called aterametre ) is over six times the distance from theEarth to theSun . A billion square inches could make a square about one half mile on a side. A bolt of finely woven1000-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. There are one billion cubicmillimetres in acubic metre , and a billion cubic metres in acubic 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. Any object that weighs one billion kilograms (2.2× 109 lb) would weigh about as much as 5,525 emptyBoeing 747-400s . A cube of iron that weighs one billion pounds (450,000,000 kg) would be 38.62 metres (126.7 ft) on each side. A small mountain, slightly larger thanStone 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, theworld population was one billion. A is a cube;B consists of 1000 cubes the size of cubeA ,C consists of 1000 cubes the size of cubeB ; andD consists of 1000 cubes the size of cubeC . Thus there are1 million A -sized cubes inC ; and 1,000,000,000A -sized cubes inD .
Selected 10-digit numbers (1,000,000,000–9,999,999,999)[ edit ] 1,000,000,000 to 1,999,999,999[ edit ] 1,000,000,007 : smallestprime number with 10 digits.[ 10] 1,000,006,281 : smallesttriangular number with 10 digits and the 44,721st triangular number.[ 11] 1,000,014,129 = 316232 , the smallest ten-digit square.[ 12] 1,003,003,001 = 10013 .1,026,753,849 = 320432 , the smallestpandigital square in base 10.[ 13] 1,069,863,695 : number of square (0,1)-matrices without zero rows and with exactly 9 entries equal to 1[ 14] 1,073,741,824 = 327682 = 10243 = 645 = 326 = 810 = 415 = 230 1,073,742,724 :Leyland number using 2 and 30 (230 + 302 )1,073,792,449 : Leyland number using 4 and 15 (415 + 154 )1,093,104,961 : number of (unordered, unlabeled) rooted trimmedtrees with 28 nodes[ 15] 1,096,671,326 : number of uniform rooted trees with 26 nodes[ 16] 1,104,891,746 : number ofpartially ordered set with 12 unlabeled elements[ 17] 1,111,111,111 :repunit .1,129,760,415 : 23rdMotzkin number .[ 18] 1,134,903,170 : 45thFibonacci number .[ 19] 1,160,290,625 = 655 1,162,261,467 = 319 1,162,268,326 : Leyland number using 3 and 19 (319 + 193 )1,163,962,800 : smallestsuperabundant number that is nothighly composite [ 20] 1,166,732,814 : number of signed trees with 17 nodes[ 21] 1,173,741,824 : Leyland number using 8 and 10 (810 + 108 )1,220,703,125 = 513 1,221,074,418 : Leyland number using 5 and 13 (513 + 135 )1,252,332,576 = 665 1,280,000,000 = 207 1,291,467,969 = 359372 = 10893 = 336 1,311,738,121 : 25thPell number .[ 22] 1,350,125,107 = 675 1,382,958,545 : 15thBell number .[ 23] 1,392,251,012 : number of secondary structures of RNA molecules with 27 nucleotides[ 24] 1,405,695,061 :Markov prime .[ 25] 1,406,818,759 : 30thWedderburn–Etherington number .[ 26] 1,421,542,641 : logarithmic number.[ 27] 1,453,933,568 = 685 1,464,407,113 : number of series-reduced trees with 39 nodes[ 28] 1,475,789,056 = 384162 = 1964 = 148 1,528,823,808 = 11523 1,533,776,805 : bothpentagonal andtriangular .[ 29] 1,544,804,416 = 393042 = 11563 = 346 1,564,031,349 = 695 1,606,879,040 : Dowling number[ 30] 1,631,432,881 = 403912 ,square triangular number 1,673,196,525 : Least common multiple of the odd integers from 1 to 25[ 31] 1,677,922,740 : number of series-reduced planted trees with 36 nodes[ 32] 1,680,700,000 = 705 1,755,206,648 : coefficient of a ménage hit polynomial[ 33] 1,767,263,190 : The 19thCatalan number .[ 34] 1,787,109,376 : 1-automorphic number [ 35] 1,801,088,541 = 217 1,804,229,351 = 715 1,808,141,741 : number of partitions of 280 into divisors of 280[ 36] 1,808,676,326 : number of 38-bead necklaces (turning over is allowed) where complements are equivalent[ 37] 1,836,311,903 : 46th Fibonacci number.[ 19] 1,838,265,625 = 428752 = 12253 = 356 1,848,549,332 : number of partitions of 270 into divisors of 270[ 36] 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[ 38] 1,882,341,361 : The smallest prime whose reversal is asquare triangular number (triangular of 57121).[citation needed ] 1,921,525,212 : number of partitions of 264 into divisors of 264[ 36] 1,934,502,740 : number of parallelogram polyominoes with 27 cells.[ 39] 1,934,917,632 = 725 1,977,326,743 = 711 1,979,339,339 : largestright-truncatable prime in decimal, if 1 is considered to be a prime[ 40] 1,996,813,914 : Leyland number using 7 and 11 (711 + 117 ) 2,000,000,000 to 2,999,999,999[ edit ] 2,023,443,032 : number of trees with 28 unlabeled nodes[ 41] 2,038,074,743 : 100,000,000th prime number[citation needed ] 2,062,142,876 : number of centered hydrocarbons with 30 carbon atoms[ 42] 2,073,071,593 = 735 2,147,483,647 : 8thMersenne prime ,[ 43] 3rddouble Mersenne prime ,[ 44] and the largest signed 32-bit integer.[ 45] 2,147,483,648 = 231 2,147,484,609 : Leyland number using 2 and 31 (231 + 312 )2,176,782,336 = 466562 = 12963 = 2164 = 366 = 612 2,179,768,320 : Leyland number using 6 and 12 (612 + 126 )2,214,502,422 : 6thprimary pseudoperfect number .[ 46] 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.[ 47] 2,357,947,691 = 13313 = 119 2,373,046,875 = 755 2,494,357,888 = 227 2,521,008,887 : 4thMills' 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 2,695,730,992 : number of (unordered, unlabeled) rooted trimmed trees with 29 nodes[ 15] 2,706,784,157 = 775 2,870,671,950 : number of free 20-ominoes[ 48] 2,873,403,980 : number of uniform rooted trees with 27 nodes[ 16] 2,834,510,744 : number of nonequivalent dissections of a 22-gon into 19 polygons by non-intersecting diagonals up to rotation[ 49] 2,887,174,368 = 785 2,971,215,073 : 11thFibonacci prime (47th Fibonacci number[ 19] ) and a Markov prime.[ 25] 3,000,000,000 to 3,999,999,999[ edit ] 3,010,936,384 = 548722 = 14443 = 386 3,077,056,399 = 795 3,166,815,962 : 26th Pell number.[ 22] 3,192,727,797 : 24th Motzkin number.[ 18] 3,276,800,000 = 805 3,323,236,238 : 31st Wedderburn–Etherington number.[ 26] 3,333,333,333 : repdigit3,404,825,447 = 237 3,405,691,582 = CAFEBABE16 ; used as amagic debug value in programming.3,405,697,037 = CAFED00D16 ; used as amagic debug value in programming.3,461,824,644 : number of secondary structures of RNA molecules with 28 nucleotides[ 24] 3,486,784,401 = 590492 = 2434 = 815 = 910 = 320 3,486,792,401 : Leyland number using 3 and 20 (320 + 203 )3,492,564,909 = 12 +34 +56 +78 +910 3,518,743,761 = 593192 = 15213 = 396 3,520,581,954 : number of series-reduced planted trees with 37 nodes[ 32] 3,524,337,980 : number of 39-bead necklaces (turning over is allowed) where complements are equivalent[ 37] 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[ 38] 3,663,002,302 : number of prime numbers having eleven digits[ 50] 3,697,909,056 : number of primitive polynomials of degree 37 overGF(2) [ 51] 3,707,398,432 = 825 3,715,891,200 :double factorial of 20[ 52] 3,735,928,559 = DEADBEEF16 ; used as amagic debug value in programming.3,735,929,054 = DEADC0DE16 ; used as amagic debug value in programming.3,939,040,643 = 835 4,000,000,000 to 4,999,999,999[ edit ] 4,096,000,000 = 640002 = 16003 = 406 4,118,054,813 : number of primes under 1011 [ 53] 4,182,119,424 = 845 4,294,967,291 : Largest prime 32-bit unsigned integer.[ 54] 4,294,967,295 : Maximum 32-bit unsigned integer (FFFFFFFF16 ),perfect totient number , product of all knownFermat primes F 0 {\displaystyle F_{0}} throughF 4 {\displaystyle F_{4}} .4,294,967,296 = 655362 = 2564 = 168 = 416 = 232 4,294,967,297 :F 5 {\displaystyle F_{5}} , the first compositeFermat number .4,294,968,320 : Leyland number using 2 and 32 (232 + 322 )4,295,032,832 : Leyland number using 4 and 16 (416 + 164 )4,437,053,125 = 855 4,444,444,444 : repdigit4,467,033,943 : number of parallelogram polyominoes with 28 cells.[ 39] 4,486,784,401 : Leyland number using 9 and 10 (910 + 109 )4,586,471,424 = 247 4,704,270,176 = 865 4,750,104,241 = 689212 = 16813 = 416 4,807,526,976 : 48th Fibonacci number.[ 19] 4,822,382,628 : number of primitive polynomials of degree 38 overGF(2) [ 51] 4,984,209,207 : 875 5,000,000,000 to 5,999,999,999[ edit ] 5,159,780,352 = 17283 = 129 = 1,000,000,00012 , or 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[ 42] 5,354,228,880 : Least common multiple of the odd integers from 1 to 27[ 31] 5,391,411,025 : smallest oddabundant number not divisible by 3[ 55] 5,469,566,585 : number of trees with 29 unlabeled nodes[ 41] 5,489,031,744 = 740882 = 17643 = 426 5,555,555,555 : repdigit5,584,059,449 = 895 5,702,046,382 : number of signed trees with 18 nodes[ 21] 5,784,634,181 : 13thalternating factorial .[ 56] 5,904,900,000 = 905 6,000,000,000 to 6,999,999,999[ edit ] 6,103,515,625 = 781252 = 257 = 514 6,104,053,449 : Leyland number using 5 and 14 (514 + 145 )6,210,001,000 : onlyself-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 : tenthprimorial 6,564,120,420 : The 20thCatalan number .[ 34] 6,590,815,232 = 925 6,659,914,175 : number of unordered unlabeled rooted trimmed trees with 30 nodes[ 15] 6,666,666,666 : repdigit6,872,485,104 : number of 40-bead necklaces (turning over is allowed) where complements are equivalent[ 37] 6,956,883,693 = 935 6,975,757,441 = 835212 = 2894 = 178 6,983,776,800 : 15thcolossally abundant number ,[ 57] 15thsuperior highly composite number ,[ 58] and the largest number to be both.[citation needed ] 7,000,000,000 to 7,999,999,999[ edit ] 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[ 38] 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[ 36] 7,391,026,522 : number of planar partitions of 49[ 59] 7,395,528,814 : number of series-reduced planted trees with 38 nodes[ 32] 7,544,428,973 : number of uniform rooted trees with 28 nodes[ 16] 7,645,370,045 : 27th Pell number.[ 22] 7,737,809,375 = 955 7,777,777,777 : repdigit7,778,742,049 : 49th Fibonacci number.[ 19] 7,862,958,391 : 32nd Wedderburn–Etherington number.[ 26] 8,000,000,000 to 8,999,999,999[ edit ] 8,031,810,176 = 267 8,153,726,976 = 965 8,212,890,625 : 1-automorphic number [ 35] 8,303,765,625 = 911252 = 20253 = 456 8,549,176,320 : pandigital number with the digits arranged in alphabetical order by English name8,587,340,257 = 975 8,589,866,963 : number of subsets of {1,2,...,33} with relatively prime elements[ 60] 8,589,869,056 : 6thperfect number .[ 61] 8,589,934,592 = 20483 = 811 = 233 8,589,935,681 :Leyland prime [ 62] using 2 and 33 (233 + 332 )8,622,571,758 : number of secondary structures of RNA molecules with 29 nucleotides[ 24] 8,804,293,473 : Leyland number using 8 and 11 (811 + 118 )8,888,888,888 : repdigit 9,000,000,000 to 9,999,999,999[ edit ] 9,039,207,968 = 985 9,043,402,501 : 25thMotzkin number .[ 18] 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,[citation needed ] largest pandigital pure power.[citation needed ] 9,876,543,210 : largest pandigital number.9,999,800,001 = 999992 , the largest ten-digit square.9,999,999,967 : greatest prime number with 10 digits[ 63] 9,999,999,999 : largest 10-digit number, repdigit^ "Definition of BIL" .www.merriam-webster.com . Retrieved2024-12-16 .^ "figures" .The Economist Style Guide (11th ed.).The Economist . 2015.ISBN 9781782830917 .^ "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. ^ "How many is a billion?" .OxfordDictionaries.com . Archived fromthe original on January 12, 2017. Retrieved13 November 2017 .^ "billion,thousand million,milliard" .Google Ngram Viewer . Retrieved13 November 2017 .^ "Cosmic Detectives" .European Space Agency . 2 April 2013.^ Panken, Eli (27 July 2016)."Apple Announces It Has Sold One Billion iPhones" .NBCNews.com . Retrieved22 April 2023 . ^ Seethamaram, Deep (27 July 2016)."Facebook Posts Strong Profit and Revenue Growth" .The Wall Street Journal . Retrieved13 November 2017 . ^ Burke, Jeremy (16 June 2015)."How the World Became A Giant Ant Colony" .Atlas Obscura . Retrieved13 November 2017 . ^ 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 A068093 (Smallest n-digit triangular number)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ "A061432 - OEIS" .oeis.org . Retrieved2025-06-30 .^ Sloane, N. J. A. (ed.)."Sequence A225218 (Square numbers containing all the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c 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 A317712 (Number of uniform rooted trees with n nodes)" .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.^a b c Sloane, N. J. A. (ed.)."Sequence A001006 (Motzkin numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c d e Sloane, N. J. A. (ed.)."Sequence A000045 (Fibonacci numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A166735 (Superabundant numbers that are not highly composite)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A000060 (Number of signed trees with n nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c Sloane, N. J. A. (ed.)."Sequence A000129 (Pell 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.^a b c 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 A178444 (Markov numbers that are prime)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c Sloane, N. J. A. (ed.)."Sequence A001190 (Wedderburn-Etherington numbers)" .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 A000014 (Number of series-reduced trees with n nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A014979 (Numbers that are both triangular and pentagonal)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A007405 (Dowling numbers: e.g.f.: exp(x + (exp(b*x) - 1)/b) with b=2)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A003418 (Least common multiple of the first n natural numbers)" .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.^ Sloane, N. J. A. (ed.)."Sequence A000033 (Coefficients of ménage hit polynomials)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A000108 (Catalan numbers: (2n)!/(n!(n+1)!))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A003226 (Automorphic numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c d 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 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.^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))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A012883 (Numbers in which every prefix (in base 10) is 1 or a prime.)" .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 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 A000668 (Mersenne primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A263686 (Smallest prime factor of double Mersenne numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ "13.1.2 Integer Types (Exact Value) - INTEGER, INT, SMALLINT, TINYINT, MEDIUMINT, BIGINT" . dev.mysql.com. RetrievedJanuary 9, 2026 .^ Sloane, N. J. A. (ed.)."Sequence A054377 (Primary pseudoperfect numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A000105 (Number of free polyominoes with n cells)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ 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)" .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.^a b Sloane, N. J. A. (ed.)."Sequence A011260 (Number of primitive polynomials of degree n over GF(2))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A006882 (Double factorials)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A006880 (Number of primes smaller than powers of ten))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A014234 (Number of primes smaller than powers of two))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A115414 (Odd abundant numbers not divisible by 3.)" .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 A004490 (Colossally abundant numbers)" .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 A000219 (Number of planar partitions (or plane partitions) of n)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A085945 (Number of subsets of {1,2,...,n} with relatively prime elements)" .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.^ Sloane, N. J. A. (ed.)."Sequence A094133 (Leyland prime numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ "Greatest prime number with 10 digits" .Wolfram Alpha . Retrieved13 November 2017 .
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