BCD 0001 0010 0011 → pure binary

exam standardthe conversion that needs real arithmetic

Answer

1111011

Why this example is worth doing

Converting BCD to a pure binary integer is not regrouping — it requires multiplying by ten and adding, digit by digit, because the two representations have genuinely different place values. The page contrasts it with the hex-to-binary conversion on the base converter page, which is pure grouping, and the comparison explains why: sixteen is a power of two and ten is not.

Try your own input in the BCD converter. Pack and unpack binary-coded decimal, and add with the +6 correction shown.

How the answer is reached

Decode packed BCD 000100100011

Decode packed BCD 000100100011 — columns group, bits, digit
groupbitsdigit
000011
100102
200113

value123

Base 10 to base 2

Convert 123 from base 10 to base 2. The sign is carried across unchanged; only the magnitude is converted.

Positional expansion of the input — Base 10 to base 2
digitvalueweightweight (base 10)digit x weight
1110^2100100
2210^11020
3310^013
total123

Integer part: divide by 2 and read the remainders bottom to top.

Read the last column bottom to top. ↑ — Base 10 to base 2
ndivide byquotientremainder
123123 ÷ 2611
6161 ÷ 2301
3030 ÷ 2150
1515 ÷ 271
77 ÷ 231
33 ÷ 211
11 ÷ 201

123 (base 10)1111011 (base 2)

Compare with

Open the BCD converter

This input is entered in the tool itself — it is too rich for a link to carry.

Note:

Notation this page assumes

  • Bit strings are written most significant bit first, and bit 0 is the least significant bit.
  • A width is stated explicitly wherever it changes the answer; nothing is silently sign-extended or truncated.
  • Fractions are converted digit by digit and shown to a stated number of places rather than rounded silently.

Sources

  • Knuth, The Art of Computer Programming, Vol. 2, §4.1 “Positional Number Systems” (1997)
  • ANSI X3.4 / ISO-IEC 646, the ASCII character set