1,000,000: Difference between revisions

← 999999 1000000 1000001 →
List of numbers; Integers; ← 100 101 102 103 104 105 106 107 108 109
Cardinal	one million
Ordinal	1000000th; (one millionth)
Factorization	26 × 56
Greek numeral
Roman numeral	M
Binary	111101000010010000002
Ternary	12122102020013
Senary	332333446
Octal	36411008
Duodecimal	40285412
Hexadecimal	F424016
Egyptian hieroglyph	𓁨

Browse history interactively

← Previous edit Next edit →

Content deleted Content added

VisualWikitext

Inline

Revision as of 10:08, 9 June 2024

1,000,000 (one million), or one thousand thousand, is the natural number following 999,999 and preceding 1,000,001. The word is derived from the early Italian millione (milione in modern Italian), from mille, "thousand", plus the augmentative suffix -one.^[1]

It is commonly abbreviated:

in British English as m^[2]^[3]^[4] (not to be confused with the metric prefix "m" milli, for 10⁻³, or with metre),
M,^[5]^[6]
MM ("thousand thousands", from Latin "Mille"; not to be confused with the Roman numeral MM = 2,000),
mm (not to be confused with millimetre), or
mn, mln, or mio can be found in financial contexts.^[7]^[8]

In scientific notation, it is written as 1×10⁶ or 10⁶.^[9] Physical quantities can also be expressed using the SI prefix mega (M), when dealing with SI units; for example, 1 megawatt (1 MW) equals 1,000,000 watts.

The meaning of the word "million" is common to the short 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 a metaphor for a very large number, as in "Not in a million years" and "You're one in a million", or a hyperbole, as in "I've walked a million miles" and "You've asked a million-dollar question".

1,000,000 is also the square of 1000 and also the cube of 100.

Visualisation of powers of ten from 1 to 1 million

Visualizing one million

Even though it is often stressed that counting 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 an Encyclopædia Britannica, or 600 pages of pulp paperback fiction contains approximately one million characters.
Length: There are one million millimetres in a kilometre, and roughly a million sixteenths of an inch in a mile (1 sixteenth = 0.0625). A typical car tire might rotate a million times in a 1,900-kilometre (1,200 mi) trip, while the engine would do several times that number of revolutions.
Fingers: If the width 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 cm²) 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 of table salt or granulated sugar 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 room 8+1⁄3 feet long by 8+1⁄3 feet wide by 8+1⁄3 feet high.
Mass: A million cubic millimetres (small droplets) of water would have a volume of one litre and a mass of one kilogram. A million millilitres or cubic centimetres (one cubic metre) of water has a mass of a million grams or one tonne.
Weight: A million 80-milligram (1.2 gr) honey bees would weigh the same as an 80 kg (180 lb) person.
Landscape: A pyramidal hill 600 feet (180 m) wide at the base and 100 feet (30 m) high would weigh about a million short tons.
Computer: A display resolution of 1,280 by 800 pixels contains 1,024,000 pixels.
Money: A USD bill of any denomination weighs 1 gram (0.035 oz). There are 454 grams in a pound. One million USD bills would weigh 1 megagram (1,000 kg; 2,200 lb) or 1 tonne (just over 1 short ton).
Time: A million seconds, 1 megasecond, is 11.57 days.

In Indian English and Pakistani English, it is also expressed as 10 lakh. Lakh is derived from lakṣa for 100,000 in Sanskrit.

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)

1,000,001 to 1,999,999

1,000,003 = Smallest 7-digit prime number
1,000,405 = Smallest triangular number with 7 digits and the 1,414th triangular number
1,002,001 = 1001², palindromic square
1,006,301 = First number of the first pair of prime quadruplets occurring thirty apart ({1006301, 1006303, 1006307, 1006309} and {1006331, 1006333, 1006337, 1006339})^[10]
1,024,000 = Sometimes, the number of bytes in a megabyte^[11]
1,030,301 = 101³, palindromic cube
1,037,718 = Large Schröder number
1,048,576 = 1024² = 32⁴ = 16⁵ = 4¹⁰ = 2²⁰, the number of bytes in a mebibyte (previously called a megabyte)
1,048,976 = smallest 7 digit Leyland number
1,058,576 = Leyland number
1,058,841 = 7⁶ x 3²
1,077,871 = the amount of prime numbers between 0 and 16777216(2^24)
1,084,051 = fifth Keith prime^[12]
1,089,270 = harmonic divisor number^[13]
1,111,111 = repunit
1,112,083 = logarithmic number^[14]
1,129,308³² + 1 is prime^[15]
1,136,689 = Pell number,^[16] Markov number^[17]
1,174,281 = Fine number^[18]
1,185,921 = 1089² = 33⁴
1,200,304 = 1⁷ + 2⁷ + 3⁷ + 4⁷ + 5⁷ + 6⁷ + 7⁷ ^[19]
1,203,623 = smallest unprimeable number ending in 3^[20]^[21]
1,234,321 = 1111², palindromic square
1,246,863 = Number of 27-bead necklaces (turning over is allowed) where complements are equivalent^[22]
1,256,070 = number of reduced trees with 29 nodes^[23]
1,262,180 = number of triangle-free graphs on 12 vertices^[24]
1,278,818 = Markov number^[17]
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^[25]
1,296,000 = number of primitive polynomials of degree 25 over GF(2)^[26]
1,299,709 = 100,000th prime number
1,336,336 = 1156² = 34⁴
1,346,269 = Fibonacci number,^[27] Markov number^[17]
1,367,631 = 111³, palindromic cube
1,413,721 = square triangular number^[28]
1,419,857 = 17⁵
1,421,280 = harmonic divisor number^[13]
1,441,440 = colossally abundant number,^[29] superior highly composite number^[30]
1,441,889 = Markov number^[17]
1,500,625 = 1225² = 35⁴
1,539,720 = harmonic divisor number^[13]
1,563,372 = Wedderburn-Etherington number^[31]
1,594,323 = 3¹³
1,596,520 = Leyland number
1,606,137 = number of ways to partition {1,2,3,4,5,6,7,8,9} and then partition each cell (block) into subcells.^[32]
1,607,521/1,136,689 ≈ √2
1,647,086 = Leyland number
1,671,800 = Initial number of first century xx00 to xx99 consisting entirely of composite numbers^[33]
1,679,616 = 1296² = 36⁴ = 6⁸
1,686,049 = Markov prime
1,687,989 = number of square (0,1)-matrices without zero rows and with exactly 7 entries equal to 1^[34]
1,719,900 = number of primitive polynomials of degree 26 over GF(2)^[26]
1,730,787 = Riordan number
1,741,725 = equal to the sum of the seventh power of its digits
1,771,561 = 1331² = 121³ = 11⁶, also, Commander Spock's estimate for the tribble population in the Star 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.^[35]
1,874,161 = 1369² = 37⁴
1,889,568 = 18⁵
1,928,934 = 2 x 3⁹ x 7²
1,941,760 = Leyland number
1,953,125 = 125³ = 5⁹
1,978,405 = 1⁶ + 2⁶ + 3⁶ + 4⁶ + 5⁶ + 6⁶ + 7⁶ + 8⁶ + 9⁶ + 10⁶ ^[36]

2,000,000 to 2,999,999

2,000,002 = number of surface-points of a tetrahedron with edge-length 1000^[37]
2,000,376 = 126³
2,012,174 = Leyland number
2,012,674 = Markov number^[17]
2,027,025 = double factorial of 15
2,085,136 = 1444² = 38⁴
2,097,152 = 128³ = 8⁷ = 2²¹
2,097,593 = Leyland prime^[38]
2,124,679 = largest known Wolstenholme prime^[39]
2,144,505 = number of trees with 21 unlabeled nodes^[40]
2,177,399 = smallest pandigital number in base 8.^[41]
2,178,309 = Fibonacci number^[27]
2,222,222 = repdigit
2,266,502 = number of signed trees with 13 nodes^[42]
2,274,205 = the number of different ways of expressing 1,000,000,000 as the sum of two prime numbers^[43]
2,313,441 = 1521² = 39⁴
2,356,779 = Motzkin number^[44]
2,405,236 = Number of 28-bead necklaces (turning over is allowed) where complements are equivalent^[22]
2,423,525 = Markov number^[17]
2,476,099 = 19⁵
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^[25]
2,515,169 = number of reduced trees with 30 nodes^[23]
2,560,000 = 1600² = 40⁴
2,567,284 = number of partially ordered set with 10 unlabelled elements^[45]
2,646,723 = little Schroeder number
2,674,440 = Catalan number^[46]
2,692,537 = Leonardo prime
2,704,900 = initial number of fourth century xx00 to xx99 containing seventeen prime numbers^[47]^[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^[16]
2,796,203 = Wagstaff prime,^[50] Jacobsthal prime
2,825,761 = 1681² = 41⁴
2,890,625 = 1-automorphic number^[51]
2,922,509 = Markov prime
2,985,984 = 1728² = 144³ = 12⁶ = 1,000,000₁₂ AKA a great-great-gross

3,000,000 to 3,999,999

3,111,696 = 1764² = 42⁴
3,200,000 = 20⁵
3,263,442 = product of the first five terms of Sylvester's sequence
3,263,443 = sixth term of Sylvester's sequence^[52]
3,276,509 = Markov prime
3,294,172 = 2²×7⁷^[53]
3,301,819 = alternating factorial^[54]
3,333,333 = repdigit
3,360,633 = palindromic in 3 consecutive bases: 6281826₉ = 3360633₁₀ = 1995991₁₁
3,418,801 = 1849² = 43⁴
3,426,576 = number of free 15-ominoes
3,524,578 = Fibonacci number,^[27] Markov number^[17]
3,554,688 = 2-automorphic number^[55]
3,626,149 = Wedderburn–Etherington prime^[31]
3,628,800 = 10!
3,748,096 = 1936² = 44⁴
3,880,899/2,744,210 ≈ √2

4,000,000 to 4,999,999

4,008,004 = 2002², palindromic square
4,037,913 = sum of the first ten factorials
4,084,101 = 21⁵
4,100,625 = 2025² = 45⁴
4,194,304 = 2048² = 4¹¹ = 2²²
4,194,788 = Leyland number
4,202,496 = number of primitive polynomials of degree 27 over GF(2)^[26]
4,208,945 = Leyland number
4,210,818 = equal to the sum of the seventh powers of its digits
4,213,597 = Bell number^[56]
4,260,282 = Fine number^[18]
4,297,512 = 12-th derivative of x^x at x=1^[57]
4,324,320 = colossally abundant number,^[29] superior highly composite number,^[30] pronic number
4,400,489 = Markov number^[17]
4,444,444 = repdigit
4,477,456 = 2116² = 46⁴
4,636,390 = Number of 29-bead necklaces (turning over is allowed) where complements are equivalent^[22]
4,741,632 = number of primitive polynomials of degree 28 over GF(2)^[26]
4,782,969 = 2187² = 9⁷ = 3¹⁴
4,782,974 = n such that n | (3ⁿ + 5)^[58]
4,785,713 = Leyland number
4,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^[25]
4,805,595 = Riordan number
4,826,809 = 2197² = 169³ = 13⁶
4,879,681 = 2209² = 47⁴
4,913,000 = 170³
4,937,284 = 2222²

5,000,000 to 5,999,999

5,049,816 = number of reduced trees with 31 nodes^[23]
5,096,876 = number of prime numbers having eight digits^[59]
5,134,240 = the largest number that cannot be expressed as the sum of distinct fourth powers
5,153,632 = 22⁵
5,221,225 = 2285², palindromic square
5,293,446 = Large Schröder number
5,308,416 = 2304² = 48⁴
5,496,925 = first cyclic number in base 6
5,555,555 = repdigit
5,623,756 = number of trees with 22 unlabeled nodes^[60]
5,702,887 = Fibonacci number^[27]
5,761,455 = The number of primes under 100,000,000
5,764,801 = 2401² = 49⁴ = 7⁸
5,882,353 = 588² + 2353²

6,000,000 to 6,999,999

6,250,000 = 2500² = 50⁴
6,436,343 = 23⁵
6,536,382 = Motzkin number^[44]
6,625,109 = Pell number,^[16] Markov number^[17]
6,666,666 = repdigit
6,765,201 = 2601² = 51⁴
6,948,496 = 2636², palindromic square

7,000,000 to 7,999,999

7,109,376 = 1-automorphic number^[51]
7,311,616 = 2704² = 52⁴
7,453,378 = Markov number^[17]
7,529,536 = 2744² = 196³ = 14⁶
7,652,413 = Largest n-digit pandigital prime
7,777,777 = repdigit
7,779,311 = A hit song written by Prince and released in 1982 by The Time
7,861,953 = Leyland number
7,890,481 = 2809² = 53⁴
7,906,276 = pentagonal triangular number
7,913,837 = Keith number^[12]
7,962,624 = 24⁵

8,000,000 to 8,999,999

8,000,000 = Used to represent infinity in Japanese mythology
8,108,731 = repunit prime in base 14
8,388,607 = second composite Mersenne number with a prime exponent
8,388,608 = 2²³
8,389,137 = Leyland number
8,399,329 = Markov number^[17]
8,436,379 = Wedderburn-Etherington number^[31]
8,503,056 = 2916² = 54⁴
8,675,309 = A hit song for Tommy Tutone (also a twin prime with 8,675,311)
8,675,311 = Twin prime with 8,675,309
8,877,691 = number of nonnegative integers with distinct decimal digits^[61]
8,888,888 = repdigit
8,946,176 = self-descriptive number in base 8
8,964,800 = Number of 30-bead necklaces (turning over is allowed) where complements are equivalent^[22]

9,000,000 to 9,999,999

9,000,000 = 3000²
9,150,625 = 3025² = 55⁴
9,227,465 = Fibonacci number,^[27] Markov number^[17]
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^[25]
9,261,000 = 210³
9,369,319 = Newman–Shanks–Williams prime^[62]
9,647,009 = Markov number^[17]
9,653,449 = square Stella octangula number
9,581,014 = n such that n | (3ⁿ + 5)^[58]
9,663,500 = Initial number of first century xx00 to xx99 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^[46]
9,699,690 = eighth primorial
9,765,625 = 3125² = 25⁵ = 5¹⁰
9,800,817 = equal to the sum of the seventh powers of its digits
9,834,496 = 3136² = 56⁴
9,865,625 = Leyland number
9,926,315 = equal to the sum of the seventh powers of its digits
9,938,375 = 215³, the largest 7-digit cube
9,997,156 = largest triangular number with 7 digits and the 4,471st triangular number
9,998,244 = 3162², the largest 7-digit square
9,999,991 = Largest 7-digit prime number
9,999,999 = repdigit

Notes

^ There are no centuries containing more than seventeen primes between 200 and 122,853,771,370,899 inclusive,^[48] and none containing more than fifteen between 2,705,000 and 839,296,299 inclusive.^[49]

References

^ "million". Dictionary.com Unabridged. Random House, Inc. Retrieved 4 October 2010.
^ "m". Oxford Dictionaries. Oxford University Press. Archived from the original on July 6, 2012. Retrieved 2015-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. Retrieved 2015-06-30.
^ "Definition of 'M'". Collins English Dictionary. HarperCollins Publishers. Retrieved 2015-06-30.
^ Averkamp, Harold. "Q&A: What Does M and MM Stand For?". AccountingCoach.com. AccountingCoach, LLC. Retrieved 25 June 2015.
^ "FT makes change to style guide to benefit text-to-speech software". Financial Times. The Financial Times Ltd. 4 February 2022. Retrieved 2024-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 = 10⁶
^ Sloane, N. J. A. (ed.). "Sequence A059925 (Initial members of two prime quadruples (A007530) with the smallest possible difference of 30)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Tracing the History of the Computer - History of the Floppy Disk
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c ^d ^e ^f ^g ^h ⁱ ^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)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A031971 (Sum_{1..n} k^n)". The On-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)". The On-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)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-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)". The On-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))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c ^d ^e Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001110 (Square triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b ^c Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-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))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A181098 (Primefree centuries)". The On-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)". The On-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)". The On-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.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A094133 (Leyland primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A088164 (Wolstenholme primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ 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.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A186509 (Centuries containing 17 primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A186311 (Least century 100k to 100k+99 with exactly n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A186408 (Centuries containing 16 primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^a ^b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000058 (Sylvester's sequence)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-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)". The On-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))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-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.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A088165 (NSW primes)". The On-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.)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[50] There are no centuries containing more than seventeen primes between 200 and 122,853,771,370,899 inclusive,^[48] and none containing more than fifteen between 2,705,000 and 839,296,299 inclusive.^[49]

[1] "million". Dictionary.com Unabridged. Random House, Inc. Retrieved 4 October 2010.

[2] "m". Oxford Dictionaries. Oxford University Press. Archived from the original on July 6, 2012. Retrieved 2015-06-30.

[3] "figures". The Economist Style Guide (11th ed.). The Economist. 2015. ISBN 9781782830917.

[EUStyleGuide-4] "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.

[5] "m". Merriam-Webster. Merriam-Webster Inc. Retrieved 2015-06-30.

[6] "Definition of 'M'". Collins English Dictionary. HarperCollins Publishers. Retrieved 2015-06-30.

[M&MM-7] Averkamp, Harold. "Q&A: What Does M and MM Stand For?". AccountingCoach.com. AccountingCoach, LLC. Retrieved 25 June 2015.

[8] "FT makes change to style guide to benefit text-to-speech software". Financial Times. The Financial Times Ltd. 4 February 2022. Retrieved 2024-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).

[9] David Wells (1987). The Penguin Dictionary of Curious and Interesting Numbers. London: Penguin Group. p. 185. 1,000,000 = 10⁶

[10] Sloane, N. J. A. (ed.). "Sequence A059925 (Initial members of two prime quadruples (A007530) with the smallest possible difference of 30)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[11] Tracing the History of the Computer - History of the Floppy Disk

[A007629-12] Sloane, N. J. A. (ed.). "Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A001599-13] Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". 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] Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A000129-16] Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A002559-17] ^ ^a ^b ^c ^d ^e ^f ^g ^h ⁱ ^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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A000957-18] 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[19] Sloane, N. J. A. (ed.). "Sequence A031971 (Sum_{1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[20] Collins, Julia (2019). Numbers in Minutes. United Kingdom: Quercus. p. 140. ISBN 978-1635061772.

[21] Sloane, N. J. A. (ed.). "Sequence A143641 (Odd prime-proof numbers not ending in 5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A000011-22] 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.

[A000014-23] Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[24] Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A000013-25] 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.

[A011260-26] 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.

[A000045-27] Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[28] Sloane, N. J. A. (ed.). "Sequence A001110 (Square triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A004490-29] Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A002201-30] Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A001190-31] Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[32] 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.

[33] Sloane, N. J. A. (ed.). "Sequence A181098 (Primefree centuries)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[34] 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.

[35] 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.

[36] Sloane, N. J. A. (ed.). "Sequence A000540 (Sum of 6th powers: 0^6 + 1^6 + 2^6 + ... + n^6.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[37] Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[38] Sloane, N. J. A. (ed.). "Sequence A094133 (Leyland primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[39] Sloane, N. J. A. (ed.). "Sequence A088164 (Wolstenholme primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[40] Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[41] 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.

[42] Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[43] Sloane, N. J. A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A001006-44] Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[45] 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.

[A000108-46] Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[47] Sloane, N. J. A. (ed.). "Sequence A186509 (Centuries containing 17 primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[48] Sloane, N. J. A. (ed.). "Sequence A186311 (Least century 100k to 100k+99 with exactly n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[49] Sloane, N. J. A. (ed.). "Sequence A186408 (Centuries containing 16 primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[51] Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[automorphic-52] Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[53] Sloane, N. J. A. (ed.). "Sequence A000058 (Sylvester's sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[54] 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.

[55] Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[56] Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[57] Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[58] Sloane, N. J. A. (ed.). "Sequence A005727 (n-th derivative of x^x at 1. Also called Lehmer-Comtet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A277288-59] 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.

[60] Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[61] Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[62] Sloane, N. J. A. (ed.). "Sequence A344389 (a(n) is the number of nonnegative numbers < 10^n with all digits distinct.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[63] Sloane, N. J. A. (ed.). "Sequence A088165 (NSW primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[64] 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.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[65] 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

[31]

[32]

[33]

[34]

[35]

[36]

[37]

[38]

[39]

[40]

[41]

[42]

[43]

[44]

[45]

[46]

[47]

[a]

[50]

[51]

[52]

[53]

[54]

[55]

[56]

[57]

[58]

[59]

[60]

[61]

[62]

[63]

[64]

[48]

[49]