Natural number
Look up
million in Wiktionary, the free dictionary.
1,000,000 (one million ), or onethousand thousand, is thenatural number following999,999 and preceding 1,000,001. The word is derived from the early Italianmillione (milione in modern Italian), frommille , "thousand", plus theaugmentative suffix-one .[ 1]
It is commonly abbreviated:
in British English asm [ 2] [ 3] [ 4] (not to be confused with themetric prefix "m"milli , for 10−3 , or withmetre ), M ,[ 5] [ 6] MM ("thousand thousands", from Latin "Mille"; not to be confused with theRoman numeral MM = 2,000),mm (not to be confused withmillimetre ), ormn ,mln , ormio can be found in financial contexts.[ 7] [ 8] Inscientific notation , it is written as 1× 106 or 106 .[ 9] Physical quantities can also be expressed using theSI prefix mega (M), when dealing withSI units; for example, 1megawatt (1 MW) equals 1,000,000watts .
The meaning of the word "million" is common to theshort scale and long scale numbering systems, unlike the larger numbers, which have different names in the two systems.
The million is sometimes used in the English language as ametaphor for a very large number, as in "Not in a million years" and "You're one in a million", or ahyperbole , as in "I've walked a million miles" and "You've asked a million-dollar question".
1,000,000 is also thesquare of1000 and also thecube of100 .
Visualisation of powers of ten from 1 to 1 million Visualizing one million [ edit ] Even though it is often stressed thatcounting to precisely a million would be an exceedingly tedious task due to the time and concentration required, there are many ways to bring the number "down to size" in approximate quantities, ignoring irregularities or packing effects.
Information: Not counting spaces, the text printed on 136 pages of anEncyclopædia Britannica , or 600 pages ofpulp paperback fiction contains approximately one million characters. Length: There are one millionmillimetres in akilometre , and roughly a million sixteenths of aninch in amile (1 sixteenth = 0.0625). A typicalcar tire might rotate a million times in a 1,900-kilometre (1,200 mi) trip, while the engine would do several times that number ofrevolutions . Fingers: If thewidth of a human finger is 22 mm (7 ⁄8 in), then a million fingers lined up would cover a distance of 22 km (14 mi). If a person walks at a speed of 4 km/h (2.5 mph), it would take them approximately five and a half hours to reach the end of the fingers. Area: A square a thousand objects or units on a side contains a million such objects or square units, so a million holes might be found in less than three square yards of window screen, or similarly, in about one half square foot (400–500 cm2 ) of bed sheet cloth. A city lot 70 by 100 feet is about a million square inches. Volume: The cube root of one million is one hundred, so a million objects or cubic units is contained in a cube a hundred objects or linear units on a side. A million grains oftable salt or granulatedsugar occupies about 64 mL (2.3 imp fl oz; 2.2 US fl oz), the volume of a cube one hundred grains on a side. One million cubic inches would be the volume of a small room8+ 1 ⁄3 feet long by8+ 1 ⁄3 feet wide by8+ 1 ⁄3 feet high. Mass: A million cubic millimetres (small droplets) of water would have a volume of onelitre and a mass of onekilogram . A million millilitres orcubic centimetres (onecubic metre ) of water has a mass of a milliongrams or onetonne . Weight: A million 80-milligram (1.2 gr)honey bees would weigh the same as an 80 kg (180 lb) person. Landscape: Apyramidal hill 600 feet (180 m) wide at the base and 100 feet (30 m) high would weigh about a million short tons. Computer: Adisplay resolution of 1,280 by 800pixels contains 1,024,000 pixels. Money: AU.S. dollar bill of any denomination weighs 1 gram (0.035 oz). There are 454 grams in a pound. One million dollar bills would weigh 1megagram (1,000 kg; 2,200 lb) or 1 tonne (just over 1short ton ). Time: A millionseconds , 1 megasecond, is 11.57days . InIndian English andPakistani English , it is also expressed as 10lakh . Lakh is derived fromlakṣa for 100,000 inSanskrit .
One million black dots (pixels) – each tile with white or grey background contains 1000 dots(full image) Selected 7-digit numbers (1,000,001–9,999,999)[ edit ] 1,000,001 to 1,999,999[ edit ] 1,000,003 = Smallest 7-digit prime number 1,000,405 = Smallesttriangular number with 7 digits and the 1,414th triangular number1,002,001 = 10012 , palindromic square1,006,301 = First number of the first pair ofprime quadruplets occurring thirty apart ({1006301, 1006303, 1006307, 1006309} and {1006331, 1006333, 1006337, 1006339})[ 10] 1,024,000 = Sometimes, the number of bytes in amegabyte [ 11] 1,030,301 = 1013 , palindromic cube1,037,718 =Large Schröder number 1,048,576 = 10242 = 324 = 165 = 410 = 220 , the number ofbytes in amebibyte (previously called a megabyte)1,048,976 = smallest 7 digit Leyland number1,058,576 =Leyland number 1,058,841 = 76 x 32 1,077,871 = the amount ofprime numbers between 0 and 16777216(2^24)1,081,080 = 39thhighly composite number [ 12] 1,084,051 = fifthKeith prime [ 13] 1,089,270 =harmonic divisor number [ 14] 1,111,111 =repunit 1,112,083 = logarithmic number[ 15] 1,129,308 32 + 1 is prime[ 16] 1,136,689 =Pell number ,[ 17] Markov number [ 18] 1,174,281 = Fine number[ 19] 1,185,921 = 10892 = 334 1,200,304 = 17 + 27 + 37 + 47 + 57 + 67 + 77 [ 20] 1,203,623 = smallest unprimeable number ending in 3[ 21] [ 22] 1,234,321 = 11112 , palindromic square1,246,863 = Number of 27-bead necklaces (turning over is allowed) where complements are equivalent[ 23] 1,256,070 = number of reduced trees with 29 nodes[ 24] 1,262,180 = number of triangle-free graphs on 12 vertices[ 25] 1,278,818 = Markov number[ 18] 1,290,872 = number of 26-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 26] 1,296,000 = number of primitive polynomials of degree 25 over GF(2)[ 27] 1,299,709 = 100,000thprime number 1,336,336 = 11562 = 344 1,346,269 =Fibonacci number ,[ 28] Markov number[ 18] 1,367,631 = 1113 , palindromic cube1,388,705 = number ofprime knots with 16 crossings1,413,721 =square triangular number [ 29] 1,419,857 = 175 1,421,280 = harmonic divisor number[ 14] 1,441,440 = 11thcolossally abundant number ,[ 30] 11thsuperior highly composite number ,[ 31] 40thhighly composite number [ 12] 1,441,889 = Markov number[ 18] 1,500,625 = 12252 = 354 1,539,720 = harmonic divisor number[ 14] 1,563,372 =Wedderburn-Etherington number [ 32] 1,594,323 = 313 1,596,520 = Leyland number1,606,137 = number of ways to partition {1,2,3,4,5,6,7,8,9} and then partition each cell (block) into subcells.[ 33] 1,607,521 /1,136,689 ≈√2 1,647,086 = Leyland number1,671,800 = Initial number of first centuryxx 00 toxx 99 consisting entirely ofcomposite numbers [ 34] 1,679,616 = 12962 = 364 = 68 1,686,049 = Markov prime1,687,989 = number of square (0,1)-matrices without zero rows and with exactly 7 entries equal to 1[ 35] 1,719,900 = number of primitive polynomials of degree 26 over GF(2)[ 27] 1,730,787 =Riordan number 1,741,725 = equal to the sum of the seventh power of its digits1,771,561 = 13312 = 1213 = 116 , also, Commander Spock's estimate for thetribble population in theStar Trek episode "The Trouble with Tribbles "1,864,637 = k such that the sum of the squares of the first k primes is divisible by k.[ 36] 1,874,161 = 13692 = 374 1,889,568 = 185 1,928,934 = 2 x 39 x 72 1,941,760 =Leyland number 1,953,125 = 1253 = 59 1,978,405 = 16 + 26 + 36 + 46 + 56 + 66 + 76 + 86 + 96 + 106 [ 37] 2,000,000 to 2,999,999[ edit ] 2,000,002 = number of surface-points of a tetrahedron with edge-length 1000[ 38] 2,000,376 = 1263 2,012,174 = Leyland number2,012,674 = Markov number[ 18] 2,027,025 = double factorial of 152,085,136 = 14442 = 384 2,097,152 = 1283 = 87 = 221 2,097,593 = Leyland prime[ 39] using 2 & 21 (221 + 212 )2,118,107 = largest integern ≤ 10 10 {\displaystyle n\leq 10^{10}} such that∑ k = 0 22 ω ( n + k ) ≤ 57 {\displaystyle \sum _{k=0}^{22}\omega (n+k)\leq 57} , whereω ( n ) {\displaystyle \omega (n)} is theprime omega function for distinctprime factors . The corresponding sum for 2118107 is indeed 57.2,124,679 = largest knownWolstenholme prime [ 40] 2,144,505 = number of trees with 21 unlabeled nodes[ 41] 2,162,160 = 41sthighly composite number ,[ 12] 2079thtriangular number 2,177,399 = smallest pandigital number in base 8.[ 42] 2,178,309 =Fibonacci number [ 28] 2,222,222 =repdigit 2,266,502 = number of signed trees with 13 nodes[ 43] 2,274,205 = the number of different ways of expressing 1,000,000,000 as the sum of two prime numbers[ 44] 2,313,441 = 15212 = 394 2,356,779 =Motzkin number [ 45] 2,405,236 = Number of 28-bead necklaces (turning over is allowed) where complements are equivalent[ 23] 2,423,525 = Markov number[ 18] 2,476,099 = 195 2,485,534 = number of 27-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 26] 2,515,169 = number of reduced trees with 30 nodes[ 24] 2,560,000 = 16002 = 404 2,567,284 = number ofpartially ordered set with 10 unlabelled elements[ 46] 2,646,723 =little Schroeder number 2,674,440 =Catalan number [ 47] 2,692,537 = Leonardo prime2,704,900 = initial number of fourth centuryxx 00 toxx 99 containing seventeenprime numbers [ 48] [ a] {2,704,901, 2,704,903, 2,704,907, 2,704,909, 2,704,927, 2,704,931, 2,704,937, 2,704,939, 2,704,943, 2,704,957, 2,704,963, 2,704,969, 2,704,979, 2,704,981, 2,704,987, 2,704,993, 2,704,997}2,744,210 = Pell number[ 17] 2,796,203 =Wagstaff prime ,[ 51] Jacobsthal prime2,825,761 = 16812 = 414 2,890,625 = 1-automorphic number [ 52] 2,922,509 = Markov prime2,985,984 = 17282 = 1443 = 126 = 1,000,00012 AKA a great-great-gross 3,000,000 to 3,999,999[ edit ] 3,111,696 = 17642 = 424 3,200,000 = 205 3,263,442 = product of the first five terms ofSylvester's sequence 3,263,443 = sixth term of Sylvester's sequence[ 53] 3,276,509 = Markov prime3,294,172 = 22 ×77 [ 54] 3,301,819 =alternating factorial [ 55] 3,333,333 =repdigit 3,360,633 = palindromic in 3 consecutive bases: 62818269 = 336063310 = 199599111 3,418,801 = 18492 = 434 3,426,576 = number of free 15-ominoes3,524,578 = Fibonacci number,[ 28] Markov number[ 18] 3,554,688 = 2-automorphic number [ 56] 3,626,149 = Wedderburn–Etherington prime[ 32] 3,628,800 = 10!3,748,096 = 19362 = 444 3,880,899 /2,744,210 ≈√2 4,000,000 to 4,999,999[ edit ] 4,008,004 = 20022 , palindromic square4,037,913 = sum of the first ten factorials4,084,101 = 215 4,100,625 = 20252 = 454 4,194,304 = 20482 = 411 = 222 4,194,788 = Leyland number4,202,496 = number of primitive polynomials of degree 27 over GF(2)[ 27] 4,208,945 = Leyland number4,210,818 = equal to the sum of the seventh powers of its digits4,213,597 =Bell number [ 57] 4,260,282 = Fine number[ 19] 4,297,512 = 12-th derivative of xx at x=1[ 58] 4,324,320 = 12thcolossally abundant number ,[ 30] 12thsuperior highly composite number ,[ 31] pronic number 4,400,489 = Markov number[ 18] 4,444,444 =repdigit 4,477,456 = 21162 = 464 4,636,390 = Number of 29-bead necklaces (turning over is allowed) where complements are equivalent[ 23] 4,741,632 = number of primitive polynomials of degree 28 over GF(2)[ 27] 4,782,969 = 21872 = 97 = 314 4,782,974 = n such that n | (3n + 5)[ 59] 4,785,713 = Leyland number4,794,088 = number of 28-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 26] 4,805,595 =Riordan number 4,826,809 = 21972 = 1693 = 136 4,879,681 = 22092 = 474 4,913,000 = 1703 4,937,284 = 22222 5,000,000 to 5,999,999[ edit ] 5,049,816 = number of reduced trees with 31 nodes[ 24] 5,096,876 = number of prime numbers having eight digits[ 60] 5,134,240 = the largest number that cannot be expressed as the sum of distinct fourth powers5,153,632 = 225 5,221,225 = 22852 , palindromic square5,293,446 =Large Schröder number 5,308,416 = 23042 = 484 5,496,925 = firstcyclic number inbase 6 5,555,555 =repdigit 5,623,756 = number of trees with 22 unlabeled nodes[ 41] 5,702,887 = Fibonacci number[ 28] 5,761,455 = the number of primes under 100,000,0005,764,801 = 24012 = 494 = 78 5,882,353 = 5882 + 23532 6,000,000 to 6,999,999[ edit ] 6,250,000 = 25002 = 504 6,436,343 = 235 6,536,382 = Motzkin number[ 45] 6,625,109 = Pell number,[ 17] Markov number[ 18] 6,666,666 =repdigit 6,765,201 = 26012 = 514 6,948,496 = 26362 , palindromic square 7,000,000 to 7,999,999[ edit ] 7,109,376 = 1-automorphic number [ 52] 7,311,616 = 27042 = 524 7,453,378 = Markov number[ 18] 7,529,536 = 27442 = 1963 = 146 7,652,413 = Largest n-digitpandigital prime 7,777,777 =repdigit 7,779,311 =A hit song written byPrince and released in 1982 byThe Time 7,861,953 = Leyland number7,890,481 = 28092 = 534 7,906,276 = pentagonal triangular number7,913,837 = Keith number[ 13] 7,962,624 = 245 8,000,000 to 8,999,999[ edit ] 8,000,000 = Used to represent infinity in Japanese mythology8,053,393 = number ofprime knots with 17 crossings8,108,731 =repunit prime inbase 14 8,388,607 = second compositeMersenne number with a prime exponent8,388,608 = 223 8,389,137 =Leyland number 8,399,329 = Markov number[ 18] 8,436,379 = Wedderburn-Etherington number[ 32] 8,503,056 = 29162 = 544 8,675,309 = Ahit song forTommy Tutone (also atwin prime with 8,675,311)8,675,311 = Twin prime with 8,675,3098,877,691 = number of nonnegative integers with distinct decimal digits[ 61] 8,888,888 =repdigit 8,946,176 =self-descriptive number in base 88,964,800 = Number of 30-bead necklaces (turning over is allowed) where complements are equivalent[ 23] 9,000,000 to 9,999,999[ edit ] 9,000,000 = 30002 9,150,625 = 30252 = 554 9,227,465 = Fibonacci number,[ 28] Markov number[ 18] 9,256,396 = number of 29-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[ 26] 9,261,000 = 2103 9,369,319 =Newman–Shanks–Williams prime [ 62] 9,647,009 = Markov number[ 18] 9,653,449 = squareStella octangula number 9,581,014 = n such that n | (3n + 5)[ 59] 9,663,500 = Initial number of first centuryxx 00 toxx 99 that possesses an identical prime pattern to any century with four or fewer digits: its prime pattern of {9663503, 9663523, 9663527, 9663539, 9663553, 9663581, 9663587} is identical to {5903, 5923, 5927, 5939, 5953, 5981, 5987}[ 63] [ 64] 9,694,845 = Catalan number[ 47] 9,699,690 = eighthprimorial 9,765,625 = 31252 = 255 = 510 9,800,817 = equal to the sum of the seventh powers of its digits9,834,496 = 31362 = 564 9,865,625 =Leyland number 9,926,315 = equal to the sum of the seventh powers of its digits9,938,375 = 2153 , the largest 7-digit cube9,997,156 = largesttriangular number with 7 digits and the 4,471st triangular number9,998,244 = 31622 , the largest 7-digit square9,999,991 = Largest 7-digit prime number9,999,999 =repdigit There are 78,498 primes less than 106 , where 999,983 is the largest prime number smaller than 1,000,000.
Increments of 106 from 1 million through a 10 million have the following prime counts:
70,435 primes between 1,000,000 and 2,000,000.67,883 primes between 2,000,000 and 3,000,000.66,330 primes between 3,000,000 and 4,000,000.65,367 primes between 4,000,000 and 5,000,000.64,336 primes between 5,000,000 and 6,000,000.63,799 primes between 6,000,000 and 7,000,000.63,129 primes between 7,000,000 and 8,000,000.62,712 primes between 8,000,000 and 9,000,000.62,090 primes between 9,000,000 and 10,000,000.In total, there are586,081 prime numbers between 1,000,000 and 10,000,000.[ 65]
^ There are no centuries containingmore than seventeen primes between 200 and 122,853,771,370,899 inclusive,[ 49] and none containing more than fifteen between 2,705,000 and 839,296,299 inclusive.[ 50] ^ "million" .Dictionary.com Unabridged . Random House, Inc. Retrieved4 October 2010 .^ "m" .Oxford Dictionaries . Oxford University Press. Archived fromthe original on July 6, 2012. Retrieved2015-06-30 .^ "figures" .The Economist Style Guide (11th ed.). The Economist. 2015.ISBN 9781782830917 .^ "6.7 Abbreviating 'million' and 'billion' ".English Style Guide. A handbook for authors and translators in the European Commission (PDF) (2019 ed.). 26 February 2019. p. 37. ^ "m" .Merriam-Webster . Merriam-Webster Inc. Retrieved2015-06-30 .^ "Definition of 'M' " .Collins English Dictionary . HarperCollins Publishers. Retrieved2015-06-30 .^ Averkamp, Harold."Q&A: What Does M and MM Stand For?" .AccountingCoach.com . AccountingCoach, LLC. Retrieved25 June 2015 . ^ "FT makes change to style guide to benefit text-to-speech software" .Financial Times . The Financial Times Ltd. 4 February 2022. Retrieved2024-03-13 .The abbreviation of millions is now 'mn' instead of 'm'. One of the main reasons is to benefit text-to-speech software, which reads out the 'm' as metres instead of millions, confusing visually impaired readers. It also comes into line with our style for billion (bn) and trillion (tn). ^ David Wells (1987).The Penguin Dictionary of Curious and Interesting Numbers . London: Penguin Group. p. 185.1,000,000 = 106 ^ Sloane, N. J. A. (ed.)."Sequence A059925 (Initial members of two prime quadruples (A007530) with the smallest possible difference of 30)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Tracing the History of the Computer - History of the Floppy Disk ^a b c "A002182 - OEIS" .oeis.org . Retrieved2024-11-28 .^a b Sloane, N. J. A. (ed.)."Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c Sloane, N. J. A. (ed.)."Sequence A001599 (Harmonic or Ore 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 A006315 (Numbers n such that n^32 + 1 is prime)" .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.^a b c d e f g h i j k l m Sloane, N. J. A. (ed.)."Sequence A002559 (Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A000957 (Fine's sequence (or Fine numbers): number of relations of valence > 0 on an n-set; also number of ordered rooted trees with n edges having root of even degree)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A031971 (Sum_{1..n} k^n)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Collins, Julia (2019).Numbers in Minutes . United Kingdom: Quercus. p. 140.ISBN 978-1635061772 . ^ Sloane, N. J. A. (ed.)."Sequence A143641 (Odd prime-proof numbers not ending in 5)" .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 A000014 (Number of series-reduced trees with n nodes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A006785 (Number of triangle-free graphs on n vertices)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b c d 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 c d 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.^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 A001110 (Square triangular numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A004490 (Colossally abundant numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A002201 (Superior highly composite numbers)" .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 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 A181098 (Primefree centuries)" .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.^ 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 A000540 (Sum of 6th powers: 0^6 + 1^6 + 2^6 + ... + n^6.)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A005893 (Number of points on surface of tetrahedron)" .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.^ Sloane, N. J. A. (ed.)."Sequence A088164 (Wolstenholme 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.^ Sloane, N. J. A. (ed.)."Sequence A049363 (a(1) = 1; for n > 1, smallest digitally balanced number in base n)" .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 A065577 (Number of Goldbach partitions of 10^n)" .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 A000112 (Number of partially ordered sets (posets) with n unlabeled elements)" .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.^ Sloane, N. J. A. (ed.)."Sequence A186509 (Centuries containing 17 primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A186311 (Least century 100k to 100k+99 with exactlyn primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A186408 (Centuries containing 16 primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A000979 (Wagstaff primes)" .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.^ Sloane, N. J. A. (ed.)."Sequence A000058 (Sylvester's sequence)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ 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.^ Sloane, N. J. A. (ed.)."Sequence A005165 (Alternating factorials)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A030984 (2-automorphic 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.^ Sloane, N. J. A. (ed.)."Sequence A005727 (n-th derivative of x^x at 1. Also called Lehmer-Comtet numbers)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^a b Sloane, N. J. A. (ed.)."Sequence A277288 (Positive integers n such that n divides (3^n + 5))" .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 A344389 (a(n) is the number of nonnegative numbers < 10^n with all digits distinct.)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A088165 (NSW primes)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A164987 (First pair of primes (p1, p2) that begin centuries of primes having the same prime configuration, ordered by increasing p2. Each configuration is allowed only once.)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Sloane, N. J. A. (ed.)."Sequence A258275 (Smallest number k > n such that the interval k*100 to k*100+99 has exactly the same prime pattern as the interval n*100 to n*100+99)" .TheOn-Line Encyclopedia of Integer Sequences . OEIS Foundation.^ Caldwell, Chris K. "The Nth Prime Page" .PrimePages . Retrieved2022-12-03 . From the differences of theprime indexes of the smallest and largest prime numbers in ranges of increments of 105 , plus 1 (for each range).
Examples in numerical order Expression methods
Related articles (alphabetical order)
100,000 1,000,000 10,000,000 100,000,000 1,000,000,000 10,000,000,000