A request that this article title be changed to 1,000,000-9,999,999 is under discussion. Please do not move this article until the discussion is closed.

← 999999 1000000 1000001 →
Cardinalone million
Ordinal1000000th
(one millionth)
Factorization26 × 56
Greek numeral
Roman numeralM
Binary111101000010010000002
Ternary12122102020013
Senary332333446
Octal36411008
Duodecimal40285412
HexadecimalF424016
Egyptian hieroglyph𓁨

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 scientific notation, it is written as 1×106 or 106.[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.

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

2,000,000 to 2,999,999

3,000,000 to 3,999,999

4,000,000 to 4,999,999

5,000,000 to 5,999,999

6,000,000 to 6,999,999

7,000,000 to 7,999,999

8,000,000 to 8,999,999

9,000,000 to 9,999,999

See also

Notes

  1. ^ 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

  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.
  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.
  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 = 106
  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
  12. ^ 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.
  13. ^ a b c 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.
  16. ^ a b c Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^ 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.
  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.
  22. ^ 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.
  23. ^ 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.
  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.
  25. ^ 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.
  26. ^ 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.
  27. ^ a b c d e 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.
  29. ^ a b Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  30. ^ a b Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ^ a b c 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.
  44. ^ a b 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.
  46. ^ a b 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.
  50. ^ Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ^ a b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. ^ Sloane, N. J. A. (ed.). "Sequence A000058 (Sylvester's sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. ^ 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.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ^ Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  56. ^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  57. ^ 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.
  58. ^ 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.
  59. ^ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  60. ^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  61. ^ 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.
  62. ^ Sloane, N. J. A. (ed.). "Sequence A088165 (NSW primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  63. ^ 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.
  64. ^ 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.