
Here we will show you how to convert the hexadecimal number CED1 to a binary number. First note that the hexadecimal number system has sixteen different digits (0 1 2 3 4 5 6 7 8 9 A B C D E F) and the binary number system has only two different digits (0 and 1).
The four steps used to convert CED1 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in CED1 by 16⁰, multiply the second to last digit in CED1 by 16¹, multiply the third to last digit in CED1 by 16², multiply the fourth to last digit in CED1 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
D × 16¹ = 208
E × 16² = 3584
C × 16³ = 49152
Remember that the hexadecimal number system has sixteen different digits, so when doing the above calculation, we use the following values if applicable: A=10, B=11, C=12, D=13, E=14, and F=15.
Step 2)
Next, we add up all the products we got from Step 1, like this:
1 + 208 + 3584 + 49152 = 52945
Step 3)
Now we divide the sum from Step 2 by 2. Put the remainder aside. Then divide the whole part by 2 again, and put the remainder aside again. Keep doing this until the whole part is 0.
52945 ÷ 2 = 26472 with 1 remainder
26472 ÷ 2 = 13236 with 0 remainder
13236 ÷ 2 = 6618 with 0 remainder
6618 ÷ 2 = 3309 with 0 remainder
3309 ÷ 2 = 1654 with 1 remainder
1654 ÷ 2 = 827 with 0 remainder
827 ÷ 2 = 413 with 1 remainder
413 ÷ 2 = 206 with 1 remainder
206 ÷ 2 = 103 with 0 remainder
103 ÷ 2 = 51 with 1 remainder
51 ÷ 2 = 25 with 1 remainder
25 ÷ 2 = 12 with 1 remainder
12 ÷ 2 = 6 with 0 remainder
6 ÷ 2 = 3 with 0 remainder
3 ÷ 2 = 1 with 1 remainder
1 ÷ 2 = 0 with 1 remainder
Step 4)
In the final step, we take the remainders from Step 3 and put them together in reverse order to get our answer to CED1 hexadecimal to binary:
CED1 hexadecimal = 1100111011010001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
CED2 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
