Numeral systems by culture  

HinduArabic numerals  
Eastern Arabic Indian family Khmer 
Mongolian Thai Western Arabic 
East Asian numerals  
Chinese Counting rods Japanese 
Korean Suzhou Vietnamese 
Alphabetic numerals  
Abjad Armenian Āryabhaṭa Cyrillic 
Ge'ez Greek (Ionian) Hebrew 
Other systems  
Attic Babylonian Brahmi Egyptian Etruscan Inuit 
Mayan Quipu Roman Urnfield 
List of numeral system topics  
Positional systems by base  
Decimal (10)  
1, 2, 3, 4, 5, 8, 12, 16, 20, 60 more…  
The binary numeral system, or base2 number system represents numeric values using two symbols, 0 and 1. More specifically, the usual base2 system is a positional notation with a radix of 2. Owing to its straightforward implementation in digital electronic circuitry using logic gates, the binary system is used internally by all modern computers.
Contents 
The Indian scholar Pingala (circa 5th2nd century BC) developed advanced mathematical concepts for describing prosody, and in so doing presented the first known description of a binary numeral system.^{[1]}^{[2]} 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.^{[3]}^{[4]}
A set of eight trigrams and a set of 64 hexagrams, analogous to the threebit and sixbit binary numerals, were known in ancient China through the classic text I Ching. In the 11th century, scholar and philosopher Shao Yong developed a method for arranging the hexagrams which corresponds to the sequence 0 to 63, as represented in binary, with yin as 0, yang as 1 and the least significant bit on top. There is, however, no evidence that Shao understood binary computation; the ordering is also the lexicographical order on sextuples of elements chosen from a twoelement set.
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 base2 system utilized in geomancy had long been widely applied in subSaharan 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. 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".^{[5]} (See Bacon's cipher.)
The modern binary number system was fully documented by Gottfried Leibniz in the 17th century in his article Explication de l'Arithmétique Binaire. Leibniz's system uses 0 and 1, like the modern binary numeral system. As a Sinophile, Leibniz was aware of the 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.^{[6]}
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.
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.
In November 1937, George Stibitz, then working at Bell Labs, completed a relaybased computer he dubbed the "Model K" (for "Kitchen", where he had assembled it), which calculated using binary addition. Bell Labs thus authorized a full research programme in late 1938 with Stibitz at the helm. Their Complex Number Computer, completed January 8, 1940, was able to calculate complex numbers. In a demonstration to the American Mathematical Society conference at Dartmouth College on September 11, 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.
A binary 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. The following sequences of symbols could all 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
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:
When spoken, binary numerals are usually read digitbydigit, in order to distinguish them from decimal numbers. 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 is equal to the decimal value four, it would be confusing to refer to the numeral as one hundred.
Decimal  Binary 

0  0 
1  1 
2  10 
3  11 
4  100 
5  101 
6  110 
7  111 
8  1000 
9  1001 
10  1010 
11  1011 
12  1100 
13  1101 
14  1110 
15  1111 
16  10000 
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. Decimal counting uses the symbols 0 through 9, while binary only uses the symbols 0 and 1.
When the symbols for the first digit are exhausted, the nexthigher digit (to the left) is incremented, and counting starts over at 0. In decimal, counting proceeds like so:
After a digit reaches 9, an increment resets it to 0 but also causes an increment of the next digit to the left. In binary, counting is the same 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:
Since binary is a base2 system, each digit represents an increasing power of 2, with the rightmost digit representing 2^{0}, the next representing 2^{1}, then 2^{2}, 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 by:
[(1) × 2^{5}] + [(0) × 2^{4}] + [(0) × 2^{3}] + [(1) × 2^{2}] + [(0) × 2^{1}] + [(1) × 2^{0}] =
[1 × 32] + [0 × 16] + [0 × 8] + [1 × 4] + [0 × 2] + [1 × 1] = 37
To create higher numbers, additional digits are simply added to the left side of the binary representation.
Fractions in binary only terminate if the denominator has 2 as the only prime factor. As a result, does not have a finite binary representation, and this causes 10(0.1) to be not precisely equal to 1 in floating point arithmetic.
Fraction  Decimal  Binary  Fractional Approx. 

1/1  1  1  1/1 
1/2  0.5  0.1  1/2 
1/3  0.333...  0.010101...  1/4+1/16+1/64... 
1/4  0.25  0.01  1/4 
1/5  0.2  0.00110011...  1/8+1/16+1/128... 
1/6  0.1666...  0.0010101...  1/8+1/32+1/128... 
1/7  0.142857142857...  0.001001...  1/8+1/64 
1/8  0.125  0.001  1/8 
1/9  0.111...  0.000111000111...  1/16+1/32+1/64... 
1/10  0.1  0.000110011...  1/16+1/32+1/256... 
1/11  0.090909...  0.0001011101000101101...  1/16+1/64+1/128... 
1/12  0.08333...  0.00010101...  1/16+1/64+1/256... 
1/13  0.07692376923...  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... 
1/16  0.0625  0.0001  1/16 
Arithmetic in binary is much like arithmetic in other numeral systems. Addition, subtraction, multiplication, and division can be performed on binary numerals.
The simplest arithmetic operation in binary is addition. Adding two singledigit binary numbers is relatively simple, using a form of carrying:
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 singledigit numbers are added together; if the result equals or exceeds the value of the radix (10), the digit to the left is incremented:
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:
1 1 1 1 1 (carried digits) 0 1 1 0 1 + 1 0 1 1 1  = 1 0 0 1 0 0
In this example, two numerals are being added together: 01101_{2} (13_{10}) and 10111_{2} (23_{10}). The top row shows the carry bits used. Starting in the rightmost column, 1 + 1 = 10_{2}. 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 = 10_{2} again; the 1 is carried, and 0 is written at the bottom. The third column: 1 + 1 + 1 = 11_{2}. This time, a 1 is carried, and a 1 is written in the bottom row. Proceeding like this gives the final answer 100100_{2} (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.
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 has a long string of “1” digits. For example the following large binary numbers can be added in two simple steps without multiple carries from one place to the next.
1 1 1 1 1 1 1 1 (carried digits) (Long Carry Method) 1 1 1 0 1 1 1 1 1 01 1 101 1 1 1 10 + 1 0 1 0 1 1 0 0 1 1 Versus: + 1 010 1 1 0 011  + 1 0 0 0 1 0 0 0 0 0 0 sum of crossed out digits = 1 1 0 0 1 1 1 0 0 0 1  now add remaining digits 1 1 0 0 1 1 1 0 0 0 1
In this example, two numerals are being added together: 1 1 1 0 1 1 1 1 1 0_{2} (958_{10}) and 1 0 1 0 1 1 0 0 1 1_{2} (691_{10}). The top row shows the carry bits used. Instead of the standard carry from one column to the next, the lowest placevalued "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. These numbers must be crossed off since they are already added. Then simply add that result to the uncanceled digits in the second row. Proceeding like this gives the final answer 1 1 0 0 1 1 1 0 0 0 1_{2} (1649_{10}).
0  1  

0  0  1 
1  1  10 
Subtraction works in much the same way:
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 typically use two's complement notation to represent negative values. This notation eliminates 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
For further details, see two's complement.
Multiplication in binary is similar to its decimal counterpart. Two numbers A and B can be multiplied by partial products: for each digit in B, the product of that digit in A is calculated and written on a new line, shifted leftward so that its rightmost digit lines up with the digit in B 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 (A) × 1 0 1 0 (B)  0 0 0 0 ← Corresponds to a zero in B + 1 0 1 1 ← Corresponds to a one in B + 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 (A) (5.625 in decimal) × 1 1 0.0 1 (B) (6.25 in decimal)  1 0 1 1 0 1 ← Corresponds to a one in B + 0 0 0 0 0 0 ← Corresponds to a zero in B + 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)
See also Booth's multiplication algorithm.
0  1  

0  0  0 
1  0  1 
Binary division is again similar to its decimal counterpart:
Here, the divisor is 101_{2}, or 5 decimal, while the dividend is 11011_{2}, or 27 decimal. The procedure is the same as that of decimal long division; here, the divisor 101_{2} goes into the first three digits 110_{2} 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 threedigit 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 dividend of 11011_{2} divided by 101_{2} is 101_{2}, as shown on the top line, while the remainder, shown on the bottom line, is 10_{2}. In decimal, 27 divided by 5 is 5, with a remainder of 2.
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 shortcuts, 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.
To convert from a base10 integer numeral to its base2 (binary) equivalent, the number is divided by two, and the remainder is the leastsignificant bit. The (integer) result is again divided by two, its remainder is the next most significant bit. This process repeats until the result of further division becomes zero.
Conversion from base2 to base10 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 multicolumn table. For example to convert 10010101101_{2} 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 1197_{10}. Note that the first Prior Value of 0 is simply an initial decimal value. This method is an application of the Horner scheme.
Binary  1  0  0  1  0  1  0  1  1  0  1  

Decimal  1×2^{10} +  0×2^{9} +  0×2^{8} +  1×2^{7} +  0×2^{6} +  1×2^{5} +  0×2^{4} +  1×2^{3} +  1×2^{2} +  0×2^{1} +  1×2^{0} =  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 .11010110101_{2}, the first digit is , the second , etc. So if there is a 1 in the first place after the decimal, then the number is at least , 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, _{10}, in binary, is:
Converting  Result 

0.  
0.0  
0.01  
0.010  
0.0101 
Thus the repeating decimal fraction 0.3... is equivalent to the repeating binary fraction 0.01... .
Or for example, 0.1_{10}, 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.00011... . 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:
x  =  1100  .101110... 
=  1100101110  .01110...  
=  11001  .01110...  
=  1100010101  
x  =  (789/62)_{10} 
Another way of converting from binary to decimal, often quicker for a person familiar with hexadecimal, is to do so indirectly—first converting (x in binary) into (x in hexadecimal) and then converting (x in hexadecimal) into (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 divideandconquer algorithm is more effective asymptotically: given a binary number, it is divided by 10^{k}, 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 10^{k} and added to the second converted piece, where k is the number of decimal digits in the second, leastsignificant piece before conversion.
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 = 2^{4}, so it takes four digits of binary to represent one digit of hexadecimal.
The following table shows each hexadecimal digit along with the equivalent decimal value and fourdigit binary sequence:
Hex  Dec  Binary 

0  0  0000 
1  1  0001 
2  2  0010 
3  3  0011 
4  4  0100 
5  5  0101 
6  6  0110 
7  7  0111 
8  8  1000 
9  9  1001 
A  10  1010 
B  11  1011 
C  12  1100 
D  13  1101 
E  14  1110 
F  15  1111 
To convert a hexadecimal number into its binary equivalent, simply substitute the corresponding binary digits:
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:
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:
Binary is also easily converted to the octal numeral system, since octal uses a radix of 8, which is a power of two (namely, 2^{3}, 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:
And from binary to octal:
And from octal to decimal:
Nonintegers 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.01_{2} thus means:
1 × 2^{1}  (1 × 2 = 2)  plus 
1 × 2^{0}  (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 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
The phenomenon that the binary representation of any rational is either terminating or recurring also occurs in other radixbased 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,
