# Binary number

{{ safesubst:#invoke:Unsubst||$N=Use dmy dates |date=__DATE__ |$B= }}

In mathematics and digital electronics, a binary number is a number expressed in the binary numeral system, or base-2 numeral system, which represents numeric values using two different symbols: typically 0 (zero) and 1 (one). More specifically, the usual base-2 system is a positional notation with a radix of 2. Because of its straightforward implementation in digital electronic circuitry using logic gates, the binary system is used internally by almost all modern computers and computer-based devices such as mobile phones. Each digit is referred to as a bit.

## History

The modern binary number system was discovered by Gottfried Leibniz in 1679 and appears in his article Explication de l'Arithmétique Binaire. The full title is translated into English as the "Explanation of the Binary Arithmetic", which uses only the characters 1 and 0, with some remarks on its usefulness, and on the light it throws on the ancient Chinese figures of Fu Xi.[1] (1703). Leibniz's system uses 0 and 1, like the modern binary numeral system. As a Sinophile, Leibniz was aware of the Yijing (or I-Ching) and noted with fascination how its hexagrams correspond to the binary numbers from 0 to 111111, and concluded that this mapping was evidence of major Chinese accomplishments in the sort of philosophical mathematics he admired.[2]

Gottfried Leibniz
Daoist Bagua

Leibniz was first introduced to the I Ching through his contact with the French Jesuit Joachim Bouvet, who visited China in 1685 as a missionary. Leibniz saw the I Ching hexagrams as an affirmation of the universality of his own religious beliefs as a Christian.[3] Binary numerals were central to Leibniz's theology. He believed that binary numbers were symbolic of the Christian idea of creatio ex nihilo or creation out of nothing.[4]

[A concept that] is not easy to impart to the pagans, is the creation ex nihilo through God's almighty power. Now one can say that nothing in the world can better present and demonstrate this power than the origin of numbers, as it is presented here through the simple and unadorned presentation of One and Zero or Nothing.

—Leibniz's letter to the Duke of Brunswick attached with the I Ching hexagrams[3]

Binary systems predating Leibniz also existed in the ancient world. The aforementioned I Ching that Leibniz encountered dates from the 9th century BC in China.[5] The binary system of the I Ching, a text for divination, is based on the duality of yin and yang.[6] Leibniz interpreted the hexagrams as evidence of binary calculus.[3] He said that "this arithmetic by 0 and 1 is found to contain the mystery of the lines of an ancient King and philosopher named Fuxi, who is believed to have lived more than 4000 years ago, and whom the Chinese regard as the founder of their empire and their sciences."[1] The text contains a set of eight trigrams (Bagua) and a set of 64 hexagrams ("sixty-four" gua), analogous to the three-bit and six-bit binary numerals, were in use at least as early as the Zhou Dynasty of ancient China.[5] An example of Leibniz's binary numeral system is as follows:[1]

0 0 0 1   numerical value 20
0 0 1 0   numerical value 21
0 1 0 0   numerical value 22
1 0 0 0   numerical value 23

The residents of the island of Mangareva in French Polynesia were using a hybrid binary-decimal system before 1450.[7] Slit drums with binary tones are used to encode messages across Africa and Asia.[6] The Indian scholar Pingala (around 5th–2nd centuries BC) developed a binary system for describing prosody.[8][9] He used binary numbers in the form of short and long syllables (the latter equal in length to two short syllables), making it similar to Morse code.[10][11] Pingala's Hindu classic titled Chandaḥśāstra (8.23) describes the formation of a matrix in order to give a unique value to each meter. The binary representations in Pingala's system increases towards the right, and not to the left like in the binary numbers of the modern, Western positional notation.[12][13]

In the 11th century, scholar and philosopher Shao Yong developed a method for arranging the hexagrams which corresponds, albeit unintentionally, to the sequence 0 to 63, as represented in binary, with yin as 0, yang as 1 and the least significant bit on top. The ordering is also the lexicographical order on sextuples of elements chosen from a two-element set.[14]

George Boole

Similar sets of binary combinations have also been used in traditional African divination systems such as Ifá as well as in medieval Western geomancy. The base-2 system utilized in geomancy had long been widely applied in sub-Saharan Africa.

In 1605 Francis Bacon discussed a system whereby letters of the alphabet could be reduced to sequences of binary digits, which could then be encoded as scarcely visible variations in the font in any random text.[15] Importantly for the general theory of binary encoding, he added that this method could be used with any objects at all: "provided those objects be capable of a twofold difference only; as by Bells, by Trumpets, by Lights and Torches, by the report of Muskets, and any instruments of like nature".[15] (See Bacon's cipher.)

In 1854, British mathematician George Boole published a landmark paper detailing an algebraic system of logic that would become known as Boolean algebra. His logical calculus was to become instrumental in the design of digital electronic circuitry.[16]

In 1937, Claude Shannon produced his master's thesis at MIT that implemented Boolean algebra and binary arithmetic using electronic relays and switches for the first time in history. Entitled A Symbolic Analysis of Relay and Switching Circuits, Shannon's thesis essentially founded practical digital circuit design.[17]

In November 1937, George Stibitz, then working at Bell Labs, completed a relay-based computer he dubbed the "Model K" (for "Kitchen", where he had assembled it), which calculated using binary addition.[18] Bell Labs thus authorized a full research programme in late 1938 with Stibitz at the helm. Their Complex Number Computer, completed 8 January 1940, was able to calculate complex numbers. In a demonstration to the American Mathematical Society conference at Dartmouth College on 11 September 1940, Stibitz was able to send the Complex Number Calculator remote commands over telephone lines by a teletype. It was the first computing machine ever used remotely over a phone line. Some participants of the conference who witnessed the demonstration were John von Neumann, John Mauchly and Norbert Wiener, who wrote about it in his memoirs.[19][20][21]

## Representation

Any number can be represented by any sequence of bits (binary digits), which in turn may be represented by any mechanism capable of being in two mutually exclusive states. Any of the following rows of symbols can be interpreted as the binary numeric value of 667:

 1 0 1 0 0 1 1 0 1 1 ¦ − ¦ − − ¦ ¦ − ¦ ¦ x o x o o x x o x x y n y n n y y n y y
A binary clock might use LEDs to express binary values. In this clock, each column of LEDs shows a binary-coded decimal numeral of the traditional sexagesimal time.

The numeric value represented in each case is dependent upon the value assigned to each symbol. In a computer, the numeric values may be represented by two different voltages; on a magnetic disk, magnetic polarities may be used. A "positive", "yes", or "on" state is not necessarily equivalent to the numerical value of one; it depends on the architecture in use.

In keeping with customary representation of numerals using Arabic numerals, binary numbers are commonly written using the symbols 0 and 1. When written, binary numerals are often subscripted, prefixed or suffixed in order to indicate their base, or radix. The following notations are equivalent:

100101 binary (explicit statement of format)
100101b (a suffix indicating binary format)
100101B (a suffix indicating binary format)
bin 100101 (a prefix indicating binary format)
1001012 (a subscript indicating base-2 (binary) notation)
%100101 (a prefix indicating binary format)
0b100101 (a prefix indicating binary format, common in programming languages)
6b100101 (a prefix indicating number of bits in binary format, common in programming languages)

When spoken, binary numerals are usually read digit-by-digit, in order to distinguish them from decimal numerals. For example, the binary numeral 100 is pronounced one zero zero, rather than one hundred, to make its binary nature explicit, and for purposes of correctness. Since the binary numeral 100 represents the value four, it would be confusing to refer to the numeral as one hundred (a word that represents a completely different value, or amount). Alternatively, the binary numeral 100 can be read out as "four" (the correct value), but this does not make its binary nature explicit.

## Counting in binary

Decimal pattern Binary numbers
0 0
1 1
2 10
3 11
4 100
5 101
6 110
7 111
8 1000
9 1001

Counting in binary is similar to counting in any other number system. Beginning with a single digit, counting proceeds through each symbol, in increasing order. Before examining binary counting, it is useful to briefly discuss the more familiar decimal counting system as a frame of reference.

### Decimal counting

Decimal counting uses the ten symbols 0 through 9. Counting begins with the incremental substitution of the least significant digit (rightmost digit) which is often called the first digit. When the available symbols for this position are exhausted, the least significant digit is reset to 0, and the next digit of higher significance (one position to the left) is incremented (overflow), and incremental substitution of the low-order digit resumes. This method of reset and overflow is repeated for each digit of significance. Counting progresses as follows:

000, 001, 002, ... 007, 008, 009, (rightmost digit resets to zero, and next digit to the left is incremented)
010, 011, 012, ...
...
090, 091, 092, ... 097, 098, 099, (rightmost two digits reset to zero, and next digit to the left is incremented)
100, 101, 102, ...

### Binary counting

In binary, counting follows similar procedure, except that only the two symbols 0 and 1 are used. Thus, after a digit reaches 1 in binary, an increment resets it to 0 but also causes an increment of the next digit to the left:

0000,
0001, (rightmost digit starts over, and next digit is incremented)
0010, 0011, (rightmost two digits start over, and next digit is incremented)
0100, 0101, 0110, 0111, (rightmost three digits start over, and the next digit is incremented)
1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111 ...

Since binary is a base-2 system, each digit represents an increasing power of 2, with the rightmost digit representing 20, the next representing 21, then 22, and so on. To determine the decimal representation of a binary number simply take the sum of the products of the binary digits and the powers of 2 which they represent. For example, the binary number 100101 is converted to decimal form as follows:

1001012 = [ ( 1 ) × 25 ] + [ ( 0 ) × 24 ] + [ ( 0 ) × 23 ] + [ ( 1 ) × 22 ] + [ ( 0 ) × 21 ] + [ ( 1 ) × 20 ]
1001012 = [ 1 × 32 ] + [ 0 × 16 ] + [ 0 × 8 ] + [ 1 × 4 ] + [ 0 × 2 ] + [ 1 × 1 ]
1001012 = 3710

To create higher numbers, additional digits are simply added to the left side of the binary representation.

## Fractions

Fractions in binary only terminate if the denominator has 2 as the only prime factor. As a result, 1/10 does not have a finite binary representation, and this causes 10 × 0.1 not to be precisely equal to 1 in floating point arithmetic. As an example, to interpret the binary expression for 1/3 = .010101..., this means: 1/3 = 0 × 2−1 + 1 × 2−2 + 0 × 2−3 + 1 × 2−4 + ... = 0.3125 + ... An exact value cannot be found with a sum of a finite number of inverse powers of two, the zeros and ones in the binary representation of 1/3 alternate forever.

Fraction Decimal Binary Fractional approximation
1/3 0.333... 0.010101... 1/4 + 1/16 + 1/64 . . .
1/6 0.1666... 0.0010101... 1/8 + 1/32 + 1/128 . . .
1/7 0.142857142857... 0.001001... 1/8 + 1/64 + 1/512 . . .
1/9 0.111... 0.000111000111... 1/16 + 1/32 + 1/64 . . .
1/11 0.090909... 0.00010111010001011101... 1/16 + 1/64 + 1/128 . . .
1/12 0.08333... 0.00010101... 1/16 + 1/64 + 1/256 . . .
1/13 0.076923076923... 0.000100111011000100111011... 1/16 + 1/128 + 1/256 . . .
1/14 0.0714285714285... 0.0001001001... 1/16 + 1/128 + 1/1024 . . .
1/15 0.0666... 0.00010001... 1/16 + 1/256 . . .

## Binary arithmetic

Arithmetic in binary is much like arithmetic in other numeral systems. Addition, subtraction, multiplication, and division can be performed on binary numerals.

{{#invoke:main|main}}

The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.

The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple, using a form of carrying:

0 + 0 → 0
0 + 1 → 1
1 + 0 → 1
1 + 1 → 0, carry 1 (since 1 + 1 = 2 = 0 + (1 × 21) )

Adding two "1" digits produces a digit "0", while 1 will have to be added to the next column. This is similar to what happens in decimal when certain single-digit numbers are added together; if the result equals or exceeds the value of the radix (10), the digit to the left is incremented:

5 + 5 → 0, carry 1 (since 5 + 5 = 10 = 0 + (1 × 101) )
7 + 9 → 6, carry 1 (since 7 + 9 = 16 = 6 + (1 × 101) )

This is known as carrying. When the result of an addition exceeds the value of a digit, the procedure is to "carry" the excess amount divided by the radix (that is, 10/10) to the left, adding it to the next positional value. This is correct since the next position has a weight that is higher by a factor equal to the radix. Carrying works the same way in binary:

  Template:Brown
0 1 1 0 1
+   1 0 1 1 1
-------------
= 1 0 0 1 0 0 = 36


In this example, two numerals are being added together: 011012 (1310) and 101112 (2310). The top row shows the carry bits used. Starting in the rightmost column, 1 + 1 = 102. The 1 is carried to the left, and the 0 is written at the bottom of the rightmost column. The second column from the right is added: 1 + 0 + 1 = 102 again; the 1 is carried, and 0 is written at the bottom. The third column: 1 + 1 + 1 = 112. This time, a 1 is carried, and a 1 is written in the bottom row. Proceeding like this gives the final answer 1001002 (36 decimal).

When computers must add two numbers, the rule that: x xor y = (x + y) mod 2 for any two bits x and y allows for very fast calculation, as well.

#### Long carry method

A simplification for many binary addition problems is the Long Carry Method or Brookhouse Method of Binary Addition. This method is generally useful in any binary addition where one of the numbers contains a long "string" of ones. It is based on the simple premise that under the binary system, when given a "string" of digits composed entirely of Template:Varserif ones (where: Template:Varserif is any integer length), adding 1 will result in the number 1 followed by a string of Template:Var zeros. That concept follows, logically, just as in the decimal system, where adding 1 to a string of Template:Varserif 9s will result in the number 1 followed by a string of Template:Var 0s:

     Binary                        Decimal
1 1 1 1 1     likewise        9 9 9 9 9
+          1                  +          1
-----------                   -----------
1 0 0 0 0 0                   1 0 0 0 0 0


Such long strings are quite common in the binary system. From that one finds that large binary numbers can be added using two simple steps, without excessive carry operations. In the following example, two numerals are being added together: 1 1 1 0 1 1 1 1 1 02 (95810) and 1 0 1 0 1 1 0 0 1 12 (69110), using the traditional carry method on the left, and the long carry method on the right:

Traditional Carry Method                       Long Carry Method
vs.
Template:Brown            carry the 1 until it is one digit past the "string" below
1 1 1 0 1 1 1 1 1 0                       1 1 1 0 1 1 1 1 1 0  cross out the "string",
+   1 0 1 0 1 1 0 0 1 1                   +   1 0 1 0 1 1 0 0 1 1  and cross out the digit that was added to it
-----------------------                    -----------------------
= 1 1 0 0 1 1 1 0 0 0 1                     1 1 0 0 1 1 1 0 0 0 1


The top row shows the carry bits used. Instead of the standard carry from one column to the next, the lowest-ordered "1" with a "1" in the corresponding place value beneath it may be added and a "1" may be carried to one digit past the end of the series. The "used" numbers must be crossed off, since they are already added. Other long strings may likewise be cancelled using the same technique. Then, simply add together any remaining digits normally. Proceeding in this manner gives the final answer of 1 1 0 0 1 1 1 0 0 0 12 (164910). In our simple example using small numbers, the traditional carry method required eight carry operations, yet the long carry method required only two, representing a substantial reduction of effort.

0 1
0 0 1
1 1 10

The binary addition table is similar, but not the same, as the truth table of the logical disjunction operation ${\displaystyle \lor }$. The difference is that ${\displaystyle 1}$${\displaystyle \lor }$${\displaystyle 1=1}$, while ${\displaystyle 1+1=10}$.

### Subtraction

Subtraction works in much the same way:

0 − 0 → 0
0 − 1 → 1, borrow 1
1 − 0 → 1
1 − 1 → 0

Subtracting a "1" digit from a "0" digit produces the digit "1", while 1 will have to be subtracted from the next column. This is known as borrowing. The principle is the same as for carrying. When the result of a subtraction is less than 0, the least possible value of a digit, the procedure is to "borrow" the deficit divided by the radix (that is, 10/10) from the left, subtracting it from the next positional value.

    *   * * *   (starred columns are borrowed from)
1 1 0 1 1 1 0
−     1 0 1 1 1
----------------
= 1 0 1 0 1 1 1


Subtracting a positive number is equivalent to adding a negative number of equal absolute value. Computers use signed number representations to handle negative numbers—most commonly the two's complement notation. Such representations eliminate the need for a separate "subtract" operation. Using two's complement notation subtraction can be summarized by the following formula:

A − B = A + not B + 1

### Multiplication

Multiplication in binary is similar to its decimal counterpart. Two numbers Template:Varserif and Template:Varserif can be multiplied by partial products: for each digit in Template:Varserif, the product of that digit in Template:Varserif is calculated and written on a new line, shifted leftward so that its rightmost digit lines up with the digit in Template:Varserif that was used. The sum of all these partial products gives the final result.

Since there are only two digits in binary, there are only two possible outcomes of each partial multiplication:

For example, the binary numbers 1011 and 1010 are multiplied as follows:

           1 0 1 1   (Template:Varserif)
× 1 0 1 0   (Template:Varserif)
---------
0 0 0 0   ← Corresponds to the rightmost 'zero' in Template:Varserif
+     1 0 1 1     ← Corresponds to the next 'one' in Template:Varserif
+   0 0 0 0
+ 1 0 1 1
---------------
= 1 1 0 1 1 1 0


Binary numbers can also be multiplied with bits after a binary point:

               1 0 1 . 1 0 1     Template:Varserif (5.625 in decimal)
× 1 1 0 . 0 1       Template:Varserif (6.25  in decimal)
-------------------
1 . 0 1 1 0 1   ← Corresponds to a 'one' in Template:Varserif
+           0 0 . 0 0 0 0     ← Corresponds to a 'zero' in Template:Varserif
+         0 0 0 . 0 0 0
+       1 0 1 1 . 0 1
+     1 0 1 1 0 . 1
---------------------------
=   1 0 0 0 1 1 . 0 0 1 0 1  (35.15625 in decimal)


#### Multiplication table

0 1
0 0 0
1 0 1

The binary multiplication table is the same as the truth table of the logical conjunction operation ${\displaystyle \land }$.

### Division

Binary division is again similar to its decimal counterpart:

Here, the divisor is 1012, or 5 decimal, while the dividend is 110112, or 27 decimal. The procedure is the same as that of decimal long division; here, the divisor 1012 goes into the first three digits 1102 of the dividend one time, so a "1" is written on the top line. This result is multiplied by the divisor, and subtracted from the first three digits of the dividend; the next digit (a "1") is included to obtain a new three-digit sequence:

              1
___________
1 0 1   ) 1 1 0 1 1
− 1 0 1
-----
0 1 1


The procedure is then repeated with the new sequence, continuing until the digits in the dividend have been exhausted:

             1 0 1
___________
1 0 1  ) 1 1 0 1 1
− 1 0 1
-----
0 1 1
− 0 0 0
-----
1 1 1
− 1 0 1
-----
1 0


Thus, the quotient of 110112 divided by 1012 is 1012, as shown on the top line, while the remainder, shown on the bottom line, is 102. In decimal, 27 divided by 5 is 5, with a remainder of 2.

### Square root

The process of taking a binary square root digit by digit is the same as for a decimal square root, and is explained here. An example is:

             1 0 0 1
---------
√ 1010001
1
---------
101     01
0
--------
1001     100
0
--------
10001    10001
10001
-------
0


## Bitwise operations

{{#invoke:main|main}} Though not directly related to the numerical interpretation of binary symbols, sequences of bits may be manipulated using Boolean logical operators. When a string of binary symbols is manipulated in this way, it is called a bitwise operation; the logical operators AND, OR, and XOR may be performed on corresponding bits in two binary numerals provided as input. The logical NOT operation may be performed on individual bits in a single binary numeral provided as input. Sometimes, such operations may be used as arithmetic short-cuts, and may have other computational benefits as well. For example, an arithmetic shift left of a binary number is the equivalent of multiplication by a (positive, integral) power of 2.

## Conversion to and from other numeral systems

### Decimal

To convert from a base-10 integer numeral to its base-2 (binary) equivalent, the number is divided by two, and the remainder is the least-significant bit. The (integer) result is again divided by two, its remainder is the next least significant bit. This process repeats until the quotient becomes zero.

Conversion from base-2 to base-10 proceeds by applying the preceding algorithm, so to speak, in reverse. The bits of the binary number are used one by one, starting with the most significant (leftmost) bit. Beginning with the value 0, repeatedly double the prior value and add the next bit to produce the next value. This can be organized in a multi-column table. For example to convert 100101011012 to decimal:

Prior value × 2 + Next bit Next value
0 × 2 + 1 = 1
1 × 2 + 0 = 2
2 × 2 + 0 = 4
4 × 2 + 1 = 9
9 × 2 + 0 = 18
18 × 2 + 1 = 37
37 × 2 + 0 = 74
74 × 2 + 1 = 149
149 × 2 + 1 = 299
299 × 2 + 0 = 598
598 × 2 + 1 = 1197

The result is 119710. Note that the first Prior Value of 0 is simply an initial decimal value. This method is an application of the Horner scheme.

 Binary  Decimal 1 0 0 1 0 1 0 1 1 0 1 1×210 + 0×29 + 0×28 + 1×27 + 0×26 + 1×25 + 0×24 + 1×23 + 1×22 + 0×21 + 1×20 = 1197

The fractional parts of a number are converted with similar methods. They are again based on the equivalence of shifting with doubling or halving.

In a fractional binary number such as 0.110101101012, the first digit is ${\displaystyle {\begin{matrix}{\frac {1}{2}}\end{matrix}}}$, the second ${\displaystyle {\begin{matrix}({\frac {1}{2}})^{2}={\frac {1}{4}}\end{matrix}}}$, etc. So if there is a 1 in the first place after the decimal, then the number is at least ${\displaystyle {\begin{matrix}{\frac {1}{2}}\end{matrix}}}$, and vice versa. Double that number is at least 1. This suggests the algorithm: Repeatedly double the number to be converted, record if the result is at least 1, and then throw away the integer part.

For example, ${\displaystyle {\begin{matrix}({\frac {1}{3}})\end{matrix}}}$10, in binary, is:

Thus the repeating decimal fraction 0.Template:Overline... is equivalent to the repeating binary fraction 0.Template:Overline... .

Or for example, 0.110, in binary, is:

Converting Result
0.1 0.
0.1 × 2 = 0.2 < 1 0.0
0.2 × 2 = 0.4 < 1 0.00
0.4 × 2 = 0.8 < 1 0.000
0.8 × 2 = 1.6 ≥ 1 0.0001
0.6 × 2 = 1.2 ≥ 1 0.00011
0.2 × 2 = 0.4 < 1 0.000110
0.4 × 2 = 0.8 < 1 0.0001100
0.8 × 2 = 1.6 ≥ 1 0.00011001
0.6 × 2 = 1.2 ≥ 1 0.000110011
0.2 × 2 = 0.4 < 1 0.0001100110

This is also a repeating binary fraction 0.0Template:Overline... . It may come as a surprise that terminating decimal fractions can have repeating expansions in binary. It is for this reason that many are surprised to discover that 0.1 + ... + 0.1, (10 additions) differs from 1 in floating point arithmetic. In fact, the only binary fractions with terminating expansions are of the form of an integer divided by a power of 2, which 1/10 is not.

The final conversion is from binary to decimal fractions. The only difficulty arises with repeating fractions, but otherwise the method is to shift the fraction to an integer, convert it as above, and then divide by the appropriate power of two in the decimal base. For example:

{\displaystyle {\begin{aligned}x&=&1100&.1{\overline {01110}}\ldots \\x\times 2^{6}&=&1100101110&.{\overline {01110}}\ldots \\x\times 2&=&11001&.{\overline {01110}}\ldots \\x\times (2^{6}-2)&=&1100010101\\x&=&1100010101/111110\\x&=&(789/62)_{10}\end{aligned}}}

Another way of converting from binary to decimal, often quicker for a person familiar with hexadecimal, is to do so indirectly—first converting (${\displaystyle x}$ in binary) into (${\displaystyle x}$ in hexadecimal) and then converting (${\displaystyle x}$ in hexadecimal) into (${\displaystyle x}$ in decimal).

For very large numbers, these simple methods are inefficient because they perform a large number of multiplications or divisions where one operand is very large. A simple divide-and-conquer algorithm is more effective asymptotically: given a binary number, it is divided by 10k, where k is chosen so that the quotient roughly equals the remainder; then each of these pieces is converted to decimal and the two are concatenated. Given a decimal number, it can be split into two pieces of about the same size, each of which is converted to binary, whereupon the first converted piece is multiplied by 10k and added to the second converted piece, where k is the number of decimal digits in the second, least-significant piece before conversion.

{{#invoke:main|main}} Template:Hexadecimal table Binary may be converted to and from hexadecimal somewhat more easily. This is because the radix of the hexadecimal system (16) is a power of the radix of the binary system (2). More specifically, 16 = 24, so it takes four digits of binary to represent one digit of hexadecimal, as shown in the table to the right.

To convert a hexadecimal number into its binary equivalent, simply substitute the corresponding binary digits:

3A16 = 0011 10102
E716 = 1110 01112

To convert a binary number into its hexadecimal equivalent, divide it into groups of four bits. If the number of bits isn't a multiple of four, simply insert extra 0 bits at the left (called padding). For example:

10100102 = 0101 0010 grouped with padding = 5216
110111012 = 1101 1101 grouped = DD16

To convert a hexadecimal number into its decimal equivalent, multiply the decimal equivalent of each hexadecimal digit by the corresponding power of 16 and add the resulting values:

C0E716 = (12 × 163) + (0 × 162) + (14 × 161) + (7 × 160) = (12 × 4096) + (0 × 256) + (14 × 16) + (7 × 1) = 49,38310

### Octal

{{#invoke:main|main}} Binary is also easily converted to the octal numeral system, since octal uses a radix of 8, which is a power of two (namely, 23, so it takes exactly three binary digits to represent an octal digit). The correspondence between octal and binary numerals is the same as for the first eight digits of hexadecimal in the table above. Binary 000 is equivalent to the octal digit 0, binary 111 is equivalent to octal 7, and so forth.

Octal Binary
0 000
1 001
2 010
3 011
4 100
5 101
6 110
7 111

Converting from octal to binary proceeds in the same fashion as it does for hexadecimal:

658 = 110 1012
178 = 001 1112

And from binary to octal:

1011002 = 101 1002 grouped = 548
100112 = 010 0112 grouped with padding = 238

And from octal to decimal:

658 = (6 × 81) + (5 × 80) = (6 × 8) + (5 × 1) = 5310
1278 = (1 × 82) + (2 × 81) + (7 × 80) = (1 × 64) + (2 × 8) + (7 × 1) = 8710

## Representing real numbers

Non-integers can be represented by using negative powers, which are set off from the other digits by means of a radix point (called a decimal point in the decimal system). For example, the binary number 11.012 thus means:

 1 × 21 (1 × 2 = 2) plus 1 × 20 (1 × 1 = 1) plus 0 × 2−1 (0 × ½ = 0) plus 1 × 2−2 (1 × ¼ = 0.25)

For a total of 3.25 decimal.

All dyadic rational numbers ${\displaystyle {\frac {p}{2^{a}}}}$ have a terminating binary numeral—the binary representation has a finite number of terms after the radix point. Other rational numbers have binary representation, but instead of terminating, they recur, with a finite sequence of digits repeating indefinitely. For instance

${\displaystyle {\frac {1_{10}}{3_{10}}}}$ = ${\displaystyle {\frac {1_{2}}{11_{2}}}}$ = 0.01010101Template:Overline2
${\displaystyle {\frac {12_{10}}{17_{10}}}}$ = ${\displaystyle {\frac {1100_{2}}{10001_{2}}}}$ = 0.10110100 10110100 Template:Overline...2

The phenomenon that the binary representation of any rational is either terminating or recurring also occurs in other radix-based numeral systems. See, for instance, the explanation in decimal. Another similarity is the existence of alternative representations for any terminating representation, relying on the fact that 0.111111… is the sum of the geometric series 2−1 + 2−2 + 2−3 + ... which is 1.

Binary numerals which neither terminate nor recur represent irrational numbers. For instance,

## Notes

1. Leibniz G., Explication de l'Arithmétique Binaire, Die Mathematische Schriften, ed. C. Gerhardt, Berlin 1879, vol.7, p.223; Engl. transl.[1]
2. {{#invoke:citation/CS1|citation |CitationClass=book }}
3. {{#invoke:citation/CS1|citation |CitationClass=book }}
4. {{#invoke:citation/CS1|citation |CitationClass=book }}
5. {{#invoke:citation/CS1|citation |CitationClass=book }}
6. {{#invoke:citation/CS1|citation |CitationClass=book }}
7. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
8. {{#invoke:citation/CS1|citation |CitationClass=book }}
9. W. S. Anglin and J. Lambek, The Heritage of Thales, Springer, 1995, ISBN 0-387-94544-X
10. Binary Numbers in Ancient India
11. Math for Poets and Drummers (pdf, 145KB)
12. Template:Cite web
13. {{#invoke:citation/CS1|citation |CitationClass=book }}
14. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
15. Template:Cite web
16. {{#invoke:citation/CS1|citation |CitationClass=book }}
17. {{#invoke:citation/CS1|citation |CitationClass=book }}
18. Template:Cite web
19. Template:Cite web
20. Template:Cite web
21. Template:Cite web

## References

• {{#invoke:citation/CS1|citation

|CitationClass=book }}