{
 "id": "ep2vsnfk2e",
 "slug": "2",
 "title": "2",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "physical",
   "label": "Physical world and mathematics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical"
  },
  {
   "id": "physical.math",
   "label": "Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
  },
  {
   "id": "physical.math.number",
   "label": "Numbers and algebra",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number"
  },
  {
   "id": "physical.math.number.arithmetic-number-systems",
   "label": "Arithmetic and number systems",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.arithmetic-number-systems"
  },
  {
   "id": "physical.math.number.number-systems",
   "label": "Number systems",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.number-systems"
  },
  {
   "id": "physical.math.number.integers-and-rationals",
   "label": "Integers and rational numbers",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.integers-and-rationals"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.nodate.physical.math.number.number-systems",
   "label": "Non-geographic · Not dated: Number systems",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate.physical.math.number.number-systems",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.nodate",
     "label": "Non-geographic · Not dated",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate"
    },
    {
     "id": "geo.nongeo.nodate.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate.physical"
    },
    {
     "id": "geo.nongeo.nodate.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate.physical.math"
    },
    {
     "id": "geo.nongeo.nodate.physical.math.number",
     "label": "Numbers and algebra",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate.physical.math.number"
    },
    {
     "id": "geo.nongeo.nodate.physical.math.number.arithmetic-number-systems",
     "label": "Arithmetic and number systems",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate.physical.math.number.arithmetic-number-systems"
    },
    {
     "id": "geo.nongeo.nodate.physical.math.number.number-systems",
     "label": "Number systems",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.nodate.physical.math.number.number-systems"
    }
   ]
  }
 ],
 "excerpt": "2, or two, is the natural number after 1 and the unique even prime, with exactly two divisors, making it the base of the binary system in computing.",
 "snippet": "2, or two, is the natural number after 1 and the unique even prime, with exactly two divisors, making it the base of the binary system in computing.",
 "node": "physical.math.number.integers-and-rationals",
 "markdown": "# 2\n\n**2** (two) is the natural number that follows 1 and precedes 3, and it is the unique even prime number: it is divisible by 2 and has exactly two distinct positive divisors, 1 and itself.<sup>[1](https://www.mathwords.com/e/even_prime.htm)</sup><sup> • </sup><sup>[2](https://metanumbers.com/2)</sup> Every other prime is an odd prime, because any even number greater than 2 is divisible by 1, 2, and itself, giving at least three divisors.<sup>[3](https://mathworld.wolfram.com/EvenPrime.html)</sup><sup> • </sup><sup>[4](https://www.encyclopedia.com/science-and-technology/mathematics/mathematics/prime-number)</sup> This double role, as the smallest prime and the base of evenness, makes 2 a dividing line throughout number theory, and its role as the base of the binary system makes it the arithmetic foundation of computing.\n\n| Key fact | Detail |\n|---|---|\n| Position | An even one-digit natural number following 1 and preceding 3<sup>[2](https://metanumbers.com/2)</sup> |\n| Prime status | The unique even prime; all other primes are odd primes<sup>[3](https://mathworld.wolfram.com/EvenPrime.html)</sup> |\n| Divisors | Exactly two distinct positive divisors, 1 and 2<sup>[1](https://www.mathwords.com/e/even_prime.htm)</sup> |\n| Parity | The prototype even number, an integer of the form \\( n = 2k \\) with \\( k = 1 \\)<sup>[5](https://mathworld.wolfram.com/EvenNumber.html)</sup> |\n| Base-2 role | Binary arithmetic uses only the characters 0 and 1, published by Leibniz in 1703<sup>[6](https://kastalia.medienhaus.udk-berlin.de/odl/Leibniz.pdf)</sup> |\n| Computing role | A bit is a binary digit, 0 or 1; one byte is \\( 2^{3} = 8 \\) bits<sup>[7](https://csrc.nist.gov/glossary/term/bit)</sup><sup> • </sup><sup>[8](https://physics.nist.gov/cuu/Units/binary.html)</sup> |\n| In Peano systems | 2 is the notation for the successor of 1<sup>[9](https://users.fmf.uni-lj.si/andrist/lectures/introduction_to_analysis.pdf)</sup> |\n\n## Evenness and parity\n\nAn even number is an integer of the form \\( n = 2k \\), where \\( k \\) is an integer, so the even numbers run \\( \\ldots, -4, -2, 0, 2, 4, 6, \\ldots \\). Because even numbers are integrally divisible by two, the congruence \\( n \\equiv 0 \\pmod 2 \\) holds for every even \\( n \\), and an integer is odd exactly when \\( n \\equiv 1 \\pmod 2 \\).<sup>[5](https://mathworld.wolfram.com/EvenNumber.html)</sup><sup> • </sup><sup>[10](https://math.libretexts.org/Courses/Mount_Royal_University/Abstract_Algebra_I/Chapter_1%3A_Integers/1.3%3A_Integers_modulo_n)</sup> The oddness or evenness of a number is called its parity, with even numbers assigned parity 0 and odd numbers parity 1.<sup>[5](https://mathworld.wolfram.com/EvenNumber.html)</sup>\n\nThe number 2 is the modulus that defines this two-way split. Products and sums obey simple parity rules because of it: the product of an even number and an odd number is always even, since \\( (2k)(2l+1) = 2[k(2l+1)] \\) is divisible by 2.<sup>[5](https://mathworld.wolfram.com/EvenNumber.html)</sup> The same structure appears in abstract algebra, where the integers modulo 2 form a two-element ring isomorphic to the parity ring whose elements are \"even\" and \"odd\".<sup>[11](https://proofwiki.org/wiki/Isomorphism_between_Ring_of_Integers_Modulo_2_and_Parity_Ring)</sup>\n\n## The smallest prime\n\nA prime number has exactly two distinct positive divisors, and 2 meets this condition with the divisors 1 and 2.<sup>[1](https://www.mathwords.com/e/even_prime.htm)</sup> It is the first prime and the only one that is even; MathWorld notes humorously that 2 is therefore the \"oddest\" prime of all.<sup>[3](https://mathworld.wolfram.com/EvenPrime.html)</sup>\n\nIts evenness shapes several parts of number theory:\n\n- **Prime gaps.** The difference between two successive primes \\( p_{k+1} - p_k \\) is always even except at the first prime \\( p_1 = 2 \\), so all prime gaps greater than 1 are even.<sup>[12](https://mathworld.wolfram.com/PrimeGaps.html)</sup>\n- **Mersenne primes.** Numbers of the form \\( 2^{p} - 1 \\), where \\( p \\) is prime, are the Mersenne numbers, and Euclid's rule for even perfect numbers uses them: an even natural number \\( N \\) is perfect if and only if \\( N = 2^{k-1}(2^{k} - 1) \\) for an integer \\( k \\) such that \\( 2^{k} - 1 \\) is a [Mersenne prime](https://www.edgepedia.org/mersenne-prime).<sup>[13](https://www.ams.org/journals/mcom/2014-83-289/S0025-5718-2013-02776-7/S0025-5718-2013-02776-7.pdf)</sup>\n- **Goldbach's conjecture.** The conjecture asserts that every positive even integer \\( n \\ge 4 \\) can be expressed as the sum of two primes \\( p + q \\), a pair called a Goldbach partition of \\( 2n \\); it remains open.<sup>[14](https://mathworld.wolfram.com/GoldbachConjecture.html)</sup> Chen's theorem, a proved approximation, states that every sufficiently large even number \\( N \\) can be written as \\( N = p + m \\), where \\( p \\) is a prime and \\( m \\) is either a prime or a semiprime.<sup>[15](https://mathworld.wolfram.com/ChensTheorem.html)</sup>\n\nAnother oddity is that 2 stands alone as the unique number \\( x \\) whose sum of reciprocals of all powers equals itself: since \\( 1/2 + 1/4 + 1/8 + \\cdots = 1 \\), the total comes to 2.<sup>[16](https://blogs.ams.org/mathmentoringnetwork/2016/03/14/the-power-of-two-two-tips-for-mathematicians/)</sup>\n\n## Base 2 and computing\n\nBecause 2 has only two states to track, it serves as the base of the binary number system, in which any number is written using only the characters 0 and 1. [Gottfried Wilhelm Leibniz](https://www.edgepedia.org/gottfried-wilhelm-leibniz) published \"Explication de l'Arithmétique Binaire\" in the Mémoires of the Paris Academy in 1703, illustrating binary addition, subtraction, multiplication, and division; Knuth's history of positional number systems calls this article the usual reference point for the birth of radix-2 arithmetic.<sup>[6](https://kastalia.medienhaus.udk-berlin.de/odl/Leibniz.pdf)</sup><sup> • </sup><sup>[17](https://www.informit.com/articles/article.aspx?p=2221791)</sup> Leibniz had developed the ideas earlier, corresponding about the principles of his binary arithmetic from February 1701, and he also connected the system to the ancient Chinese figures of Fuxi.<sup>[6](https://kastalia.medienhaus.udk-berlin.de/odl/Leibniz.pdf)</sup><sup> • </sup><sup>[18](https://ilab.org/assets/catalogues/catalogs_files_1072_sciences_catalogue.pdf)</sup>\n\nModern computing is built on this base. A bit, short for binary digit, is a value of 0 or 1, and digital computers encode text, graphics, and other information as strings of bits; the letter \"A\" is typically represented by the bit string \"01000001\".<sup>[7](https://csrc.nist.gov/glossary/term/bit)</sup><sup> • </sup><sup>[19](https://www.nist.gov/quantum-information-science/quantum-computing-explained)</sup> Powers of 2 organize the [units of information](https://www.edgepedia.org/units-of-information): one byte is \\( 2^{3} = 8 \\) bits, and the [International Electrotechnical Commission](https://www.edgepedia.org/international-electrotechnical-commission) approved prefixes for binary multiples in December 1998, so that one kibibit is \\( 2^{10} = 1024 \\) bits and one mebibyte is \\( 2^{20} = 1\\,048\\,576 \\) bytes.<sup>[8](https://physics.nist.gov/cuu/Units/binary.html)</sup> In binary floating-point arithmetic, a normalized machine number is written \\( x = (-1)^{s} \\cdot (b_{0}.b_{1}b_{2}\\ldots b_{p-1}) \\cdot 2^{E} \\), with base 2 throughout.<sup>[20](https://dlmf.nist.gov/3.1)</sup>\n\n## Foundations: how 2 is defined\n\nIn axiomatic treatments the natural numbers are generated from a starting element by a successor operation. In the [Peano axioms](https://www.edgepedia.org/peano-axioms), the successor of 0 is denoted 1, and the successor of 1 is denoted 2, so that 2 is by definition \\( S(1) \\), the number after 1.<sup>[9](https://users.fmf.uni-lj.si/andrist/lectures/introduction_to_analysis.pdf)</sup> Addition and multiplication are then defined recursively on this basis, with \\( n + 1 = S(n) \\).<sup>[9](https://users.fmf.uni-lj.si/andrist/lectures/introduction_to_analysis.pdf)</sup>\n\nPhilosophers have also asked what the number 2 is. [Bertrand Russell](https://www.edgepedia.org/bertrand-russell), in *An Introduction to Mathematical Philosophy*, proposed defining 2 as the class of all couples: \"the class of all couples will be the number 2, according to our definition,\" a definition chosen for its definiteness, since the class of couples is easier to pin down than the number itself. The mathematician E. C. Titchmarsh, discussing this account, noted the difficulties it raises, such as what counts as a member of the class of all couples.<sup>[21](https://mathshistory.st-andrews.ac.uk/Extras/Titchmarsh_Counting/)</sup>\n\n## References\n\n1. [Even Prime — Definition, Formula & Examples, Mathwords](https://www.mathwords.com/e/even_prime.htm)\n2. [2 (Number), MetaNumbers](https://metanumbers.com/2)\n3. [Even Prime — from Wolfram MathWorld](https://mathworld.wolfram.com/EvenPrime.html)\n4. [Prime Number, Encyclopedia.com](https://www.encyclopedia.com/science-and-technology/mathematics/mathematics/prime-number)\n5. [Even Number — from Wolfram MathWorld](https://mathworld.wolfram.com/EvenNumber.html)\n6. [Leibniz: Explanation of binary arithmetic (1703), facsimile transcription](https://kastalia.medienhaus.udk-berlin.de/odl/Leibniz.pdf)\n7. [bit — Glossary, NIST CSRC](https://csrc.nist.gov/glossary/term/bit)\n8. [Definitions of the SI units: The binary prefixes, NIST](https://physics.nist.gov/cuu/Units/binary.html)\n9. [2 Construction of Numbers, Introduction to Analysis lecture notes, University of Ljubljana](https://users.fmf.uni-lj.si/andrist/lectures/introduction_to_analysis.pdf)\n10. [1.3: Integers modulo n, Mathematics LibreTexts](https://math.libretexts.org/Courses/Mount_Royal_University/Abstract_Algebra_I/Chapter_1%3A_Integers/1.3%3A_Integers_modulo_n)\n11. [Isomorphism between Ring of Integers Modulo 2 and Parity Ring, ProofWiki](https://proofwiki.org/wiki/Isomorphism_between_Ring_of_Integers_Modulo_2_and_Parity_Ring)\n12. [Prime Gaps — from Wolfram MathWorld](https://mathworld.wolfram.com/PrimeGaps.html)\n13. [Mathematics of Computation 83 (2014), American Mathematical Society](https://www.ams.org/journals/mcom/2014-83-289/S0025-5718-2013-02776-7/S0025-5718-2013-02776-7.pdf)\n14. [Goldbach Conjecture — from Wolfram MathWorld](https://mathworld.wolfram.com/GoldbachConjecture.html)\n15. [Chen's Theorem — from Wolfram MathWorld](https://mathworld.wolfram.com/ChensTheorem.html)\n16. [The Power of Two: Two Tips for Mathematicians, AMS e-Mentoring Network](https://blogs.ams.org/mathmentoringnetwork/2016/03/14/the-power-of-two-two-tips-for-mathematicians/)\n17. [Positional Number Systems, The Art of Computer Programming, InformIT](https://www.informit.com/articles/article.aspx?p=2221791)\n18. [Leibniz's invention of binary arithmetic, ILAB catalogue](https://ilab.org/assets/catalogues/catalogs_files_1072_sciences_catalogue.pdf)\n19. [Quantum Computing Explained, NIST](https://www.nist.gov/quantum-information-science/quantum-computing-explained)\n20. [DLMF §3.1 Arithmetics and Error Measures, NIST](https://dlmf.nist.gov/3.1)\n21. [E C Titchmarsh on Counting, MacTutor History of Mathematics](https://mathshistory.st-andrews.ac.uk/Extras/Titchmarsh_Counting/)\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Numbers and algebra › Arithmetic and number systems › Number systems › Integers and rational numbers*\n\n*Initially written Sep 17, 2026 · Reviewed: Oct 15, 2026 · Edited: Oct 15, 2026 · Last review: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [],
 "url": "https://www.edgepedia.org/2",
 "markdown_url": "https://www.edgepedia.org/2.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"2\", Edgepedia (EdgeChat), https://www.edgepedia.org/2. Edgepedia Community License 1.0.",
 "credit_md": "\"[2](https://www.edgepedia.org/2)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/2](https://www.edgepedia.org/2). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/2\">2</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/2\">https://www.edgepedia.org/2</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "2, or two, is the natural number after 1 and the unique even prime, with exactly two divisors, making it the base of the binary system in computing."
}