A request that this article title be changed to 1,000,000,000-9,999,999,999 is under discussion. Please do not move this article until the discussion is closed.
1000000000
CardinalOne billion (short scale)
One thousand million, or one milliard (long scale)
OrdinalOne billionth (short scale)
Factorization
  • 29
  • 59
Greek numeral
Roman numeralM
Binary1110111001101011001010000000002
Ternary21202002000210100013
Senary2431212453446
Octal73465450008
Duodecimal23AA9385412
Hexadecimal3B9ACA0016

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

In standard form, it is written as 1 × 109. The metric prefix giga indicates 1,000,000,000 times the base unit. Its symbol is G.

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

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

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

In the South Asian numbering system, it is known as 100 crore or 1 arab.

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

Visualization of powers of ten from one to 1 billion

Sense of scale

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

Time

Distance

Area

Volume

Weight

Products

Nature

Count

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

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

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

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

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

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

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

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

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

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

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

References

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