{
  "id": "radix",
  "title": "Radix",
  "lang": "en",
  "source_lang": "en",
  "summary": "A radix, or base, determines the place values and permitted digits in a positional numeral system.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Base",
    "Numeral base",
    "Number base"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/radix/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/radix/",
      "json": "https://aiwiki.page/zh/radix.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A radix, or base, is the number that determines the place values in a positional numeral system. In the standard case, the radix is an integer \\(b\\geq 2\\), and each position has a value \\(b\\) times that of the position immediately to its right. Such a system uses \\(b\\) digit values, conventionally \\(0,1,\\ldots,b-1\\). Decimal notation has radix ten, while binary notation has radix two. The choice of radix changes how a number is written, not the number itself."
    },
    {
      "heading": "Definition and place value",
      "text": "For an integer radix \\(b\\geq 2\\), a finite positional numeral represents the value\n\n\\[(d_n d_{n-1}\\cdots d_0.d_{-1}\\cdots d_{-m})_b = \\sum_{k=-m}^{n} d_k b^k,\\]\n\nwhere each digit \\(d_k\\) is an integer satisfying \\(0\\leq d_k<b\\). The separator between the positions \\(b^0\\) and \\(b^{-1}\\) is called the radix point; the decimal point is its base-ten instance.\n\nFor example,\n\n\\[(347.2)_{10} = 3\\cdot10^2+4\\cdot10+7+2\\cdot10^{-1},\\]\n\nwhereas\n\n\\[(101.01)_2 = 1\\cdot2^2+0\\cdot2+1+0\\cdot2^{-1}+1\\cdot2^{-2} = (5.25)_{10}.\\]\n\nThe subscript identifies the radix and is conventionally written in decimal notation. It can be omitted when the base is clear from context. In every ordinary base \\(b\\), the numeral \\(10_b\\) denotes the number \\(b\\).\n\nThe digit zero serves as a placeholder: \\(205_{10}\\), for example, distinguishes two hundreds and five units from two tens and five units. A minus sign normally indicates a negative number; it is not part of the digit set.\n\nApart from leading zeros, every nonnegative integer has a unique finite representation in a fixed integer base \\(b\\geq2\\). Zero is conventionally written as a single zero."
    },
    {
      "heading": "Common radices",
      "text": "Radix | Conventional name | Digit symbols | Typical uses\n2 | Binary | \\(0,1\\) | Digital logic and computer arithmetic\n8 | Octal | \\(0\\)–\\(7\\) | Compact representation of binary data\n10 | Decimal | \\(0\\)–\\(9\\) | Everyday arithmetic and measurement\n12 | Duodecimal or dozenal | Twelve symbols, with conventions varying | Alternative numeral systems\n16 | Hexadecimal | \\(0\\)–\\(9\\), usually A–F | Computer memory addresses and binary data\n60 | Sexagesimal | Historically varied | Babylonian mathematics and angular or time subdivisions\n\nA radix specifies digit values, not necessarily particular printed symbols. In hexadecimal, A through F conventionally represent values ten through fifteen. In systems with larger bases, a single digit value may be written using a group of symbols.\n\nDecimal notation is the basis of the Hindu–Arabic numeral system. Its development involved decimal place value and the use of zero in Indian mathematics, followed by transmission through the Islamic world and into Europe. Earlier Babylonian mathematics used sexagesimal place value, although its notation differed from modern systems with a consistently explicit radix point.\n\nThe subdivisions of hours into minutes and seconds, and degrees into minutes and seconds, preserve sexagesimal conventions. Complete modern date and time expressions, however, combine several different unit ratios rather than forming a single uniform base-sixty numeral."
    },
    {
      "heading": "Arithmetic and the choice of base",
      "text": "The usual procedures of arithmetic depend on the radix through their carrying and borrowing rules. If a digit-column total is \\(s\\), it is replaced by the remainder on division by \\(b\\), while the quotient is carried to the next position.\n\nFor example, in base eight,\n\n\\[7_8+1_8=10_8.\\]\n\nBorrowing one unit from the next higher position supplies \\(b\\) units in the current position.\n\nRadix also affects which divisibility tests are convenient. Since\n\n\\[b\\equiv1\\pmod{b-1},\\]\n\nan integer and the sum of its base-\\(b\\) digits have the same remainder modulo \\(b-1\\). Similarly, because \\(b\\equiv-1\\pmod{b+1}\\), an alternating sum of digits gives the remainder modulo \\(b+1\\). These are applications of modular arithmetic and explain familiar decimal divisibility tests for nine and eleven."
    },
    {
      "heading": "Conversion between bases",
      "text": "Base conversion preserves a number’s value while changing its digit sequence.\n\nEvaluating a numeral\n\nA numeral can be evaluated by summing its digits times the appropriate powers of its radix:\n\n\\[(2A)_{16}=2\\cdot16+10=42.\\]\n\nFor a long integer numeral, repeated multiplication and addition gives an efficient algorithm. For example,\n\n\\[(d_3d_2d_1d_0)_b = ((d_3b+d_2)b+d_1)b+d_0.\\]\n\nThis is an instance of evaluating a polynomial by nested multiplication.\n\nProducing digits in a new base\n\nTo express a nonnegative integer in base \\(b\\), repeatedly divide by \\(b\\), recording the remainders. The remainders, read in reverse order, are the digits.\n\nFor example,\n\n\\[42=2\\cdot16+10, \\qquad 2=0\\cdot16+2,\\]\n\nso \\(42_{10}=2A_{16}\\).\n\nFor a fractional part \\(x\\), with \\(0\\leq x<1\\), repeatedly multiply by \\(b\\). At each step, the integer part becomes the next digit, and the remaining fractional part is used for the following step. This procedure may terminate or continue indefinitely.\n\nConversion between related bases\n\nWhen one radix is a power of another, conversion can be performed by grouping digits. Since \\(8=2^3\\), one octal digit corresponds to three binary digits; since \\(16=2^4\\), one hexadecimal digit corresponds to four.\n\nThus,\n\n\\[(1101\\,0110)_2=(D6)_{16}.\\]\n\nGroups are formed outward from the radix point, adding zeros at the outer ends if necessary."
    },
    {
      "heading": "Fractional expansions",
      "text": "A base-\\(b\\) expansion of a real number can continue indefinitely to the right of the radix point:\n\n\\[x=\\sum_{k=-\\infty}^{n}d_kb^k.\\]\n\nThe fractional part converges because its digit values are bounded and its place values decrease geometrically.\n\nTerminating expansions\n\nA rational number \\(p/q\\), written in lowest terms with \\(q>0\\), has a terminating base-\\(b\\) expansion exactly when\n\n\\[q\\mid b^m\\]\n\nfor some nonnegative integer \\(m\\). Equivalently, every prime factor of \\(q\\) must also divide \\(b\\).\n\nConsequently:\n\n- In base ten, a reduced denominator may contain only factors of two and five for the expansion to terminate.\n- In base two, the reduced denominator must be a power of two.\n- In base twelve, reduced denominators containing only factors of two and three yield terminating expansions.\n\nFor example,\n\n\\[\\frac18=0.125_{10}=0.001_2,\\]\n\nbut \\(1/10\\), despite terminating in decimal notation, repeats in binary.\n\nRepetition and irrationality\n\nIn any integer base \\(b\\geq2\\), a real number is rational if and only if its digit expansion is eventually periodic, counting a terminating expansion as one followed by zeros.\n\nIn the division process for a rational number, only finitely many remainders are possible. A remainder therefore either becomes zero or repeats, producing a repeating sequence of digits. Conversely, a repeating digit block can be evaluated using a geometric series, giving a rational value.\n\nAn irrational number has an expansion that neither terminates nor becomes periodic in any integer base.\n\nNonunique expansions\n\nA number with a terminating expansion also has an alternative expansion ending in an infinite sequence of digits of value \\(b-1\\). For example,\n\n\\[1=0.999\\ldots_{10}=0.111\\ldots_2.\\]\n\nIn general,\n\n\\[\\sum_{k=1}^{\\infty}(b-1)b^{-k}=1.\\]\n\nThis equality follows from the limit of the partial sums; the repeating expansion is not merely an approximation. Excluding expansions that eventually consist entirely of \\(b-1\\) gives a standard unique representation, apart from leading zeros."
    },
    {
      "heading": "Radix in computing",
      "text": "Binary arithmetic is widely used in computing because digital circuits can represent two logical states reliably. Octal and hexadecimal provide shorter written forms of binary data without changing its underlying value.\n\nThe radix of floating-point arithmetic determines the place values of the significand. A floating-point number is commonly modeled as\n\n\\[x=(-1)^s M b^e,\\]\n\nwhere \\(s\\) determines the sign, \\(M\\) is a significand of limited precision, \\(b\\) is the radix, and \\(e\\) is an exponent.\n\nAn important consequence is that a finite decimal fraction need not be exactly representable in a binary floating-point format. For example, \\(0.1_{10}\\) has an infinite repeating binary expansion and must be rounded when stored at finite binary precision. Conversely, any finite binary fraction has a terminating decimal expansion, although it may require many decimal digits.\n\nThe radix also affects representation length. For a positive integer \\(N\\), the number of base-\\(b\\) digits is\n\n\\[\\lfloor\\log_b N\\rfloor+1,\\]\n\nwhere \\(\\log_b\\) is a logarithm to base \\(b\\). Larger radices use fewer digit positions but require more distinguishable digit values. In information theory, a uniformly selected digit from \\(b\\) possibilities carries \\(\\log_2 b\\) bits of information."
    },
    {
      "heading": "Generalizations and related terminology",
      "text": "Several numeral systems modify the standard assumptions:\n\n- Negative bases: A radix such as \\(-2\\), with digits \\(0\\) and \\(1\\), permits finite representations of both positive and negative integers without a separate sign.\n- Balanced digit systems: Balanced ternary uses radix three with digit values \\(-1,0,1\\). Negative values are represented through signed digits rather than necessarily through a leading minus sign.\n- Noninteger bases: A real radix \\(\\beta>1\\) gives place values \\(\\beta^k\\). Digit selection and uniqueness depend on the rules adopted for the expansion.\n- Mixed-radix systems: The ratio between successive place values varies. Time expressions and numeral systems based on factorials are examples.\n- Bijective numeration: These systems typically use digit values \\(1,\\ldots,b\\), without a zero digit. Spreadsheet column labels provide a familiar base-26-style example.\n- Unary notation: Sometimes called base one, unary represents quantities by repetition of a symbol. It is not an ordinary positional system with successive powers of a radix.\n\nThe base of a numeral system is distinct from the cardinality of a set, even though “cardinal” and corresponding terms in some languages can resemble terminology for numeral bases. Radix describes a representation convention; cardinality describes the size of a set."
    }
  ],
  "links": [
    "positional-notation",
    "integer",
    "binary-number",
    "zero",
    "hindu-arabic-numeral-system",
    "arithmetic",
    "modular-arithmetic",
    "algorithm",
    "polynomial",
    "real-number",
    "rational-number",
    "prime-number",
    "geometric-series",
    "irrational-number",
    "limit",
    "computer-science",
    "floating-point-arithmetic",
    "logarithm",
    "information-theory",
    "factorial",
    "cardinality"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}