1,000,000,000

1000000000
CardinalOne billion (short scale)
One milliard (long scale)
One thousand million
OrdinalOne billionth (short scale)
Factorization
  • 29
  • 59
Greek numeral
Roman numeralM
Binary1110111001101011001010000000002
Ternary21202002000210100013
Senary2431212453446
Octal73465450008
Duodecimal23AA9385412
Hexadecimal3B9ACA0016

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

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.

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

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

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

It is a common metric used in macroeconomics when describing national economies.

Sense of scale

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, 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,000–9,999,999,999)

1,000,000,000 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. ↑ "Definition of BIL". www.merriam-webster.com. Retrieved 2024-12-16.
  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 A068093 (Smallest n-digit triangular number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ↑ "A061432 - OEIS". oeis.org. Retrieved 2025-06-30.
  13. ↑ Sloane, N. J. A. (ed.). "Sequence A225218 (Square numbers containing all the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ↑ 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.
  15. 1 2 3 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.
  16. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ↑ 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.
  18. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. 1 2 3 4 5 Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ↑ Sloane, N. J. A. (ed.). "Sequence A166735 (Superabundant numbers that are not highly composite)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. 1 2 Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ↑ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A004148 (Generalized Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. 1 2 Sloane, N. J. A. (ed.). "Sequence A178444 (Markov numbers that are prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ↑ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  28. ↑ Sloane, N. J. A. (ed.). "Sequence A014979 (Numbers that are both triangular and pentagonal)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  29. 1 2 Sloane, N. J. A. (ed.). "Sequence A003418 (Least common multiple of the first n natural numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  30. 1 2 3 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.
  31. ↑ Sloane, N. J. A. (ed.). "Sequence A000033 (Coefficients of ménage hit polynomials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. 1 2 Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers: (2n)!/(n!(n+1)!))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  33. 1 2 Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  34. 1 2 3 4 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.
  35. 1 2 3 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.
  36. 1 2 3 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.
  37. 1 2 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.
  38. ↑ 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.
  39. 1 2 Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  40. 1 2 Sloane, N. J. A. (ed.). "Sequence A000022 (Number of centered hydrocarbons with n atoms)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. ↑ Sloane, N. J. A. (ed.). "Sequence A000668 (Mersenne primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ↑ Sloane, N. J. A. (ed.). "Sequence A263686 (Smallest prime factor of double Mersenne numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ↑ Sloane, N. J. A. (ed.). "Sequence A054377 (Primary pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. ↑ 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.
  45. ↑ Sloane, N. J. A. (ed.). "Sequence A000105 (Number of free polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  46. ↑ 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.
  47. ↑ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. 1 2 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 A006882 (Double factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. ↑ Sloane, N. J. A. (ed.). "Sequence A006880 (Number of primes smaller than powers of ten))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ↑ Sloane, N. J. A. (ed.). "Sequence A014234 (Number of primes smaller than powers of two))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. ↑ Sloane, N. J. A. (ed.). "Sequence A115414 (Odd abundant numbers not divisible by 3.)". 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. ↑ 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.
  57. ↑ 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.
  58. ↑ Sloane, N. J. A. (ed.). "Sequence A000396 (Perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  59. ↑ Sloane, N. J. A. (ed.). "Sequence A094133 (Leyland prime numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  60. ↑ "Greatest prime number with 10 digits". Wolfram Alpha. Retrieved 13 November 2017.