
Here we will show you how to convert the hexadecimal number ACED 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 ACED from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in ACED by 16⁰, multiply the second to last digit in ACED by 16¹, multiply the third to last digit in ACED by 16², multiply the fourth to last digit in ACED by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
E × 16¹ = 224
C × 16² = 3072
A × 16³ = 40960
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:
13 + 224 + 3072 + 40960 = 44269
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.
44269 ÷ 2 = 22134 with 1 remainder
22134 ÷ 2 = 11067 with 0 remainder
11067 ÷ 2 = 5533 with 1 remainder
5533 ÷ 2 = 2766 with 1 remainder
2766 ÷ 2 = 1383 with 0 remainder
1383 ÷ 2 = 691 with 1 remainder
691 ÷ 2 = 345 with 1 remainder
345 ÷ 2 = 172 with 1 remainder
172 ÷ 2 = 86 with 0 remainder
86 ÷ 2 = 43 with 0 remainder
43 ÷ 2 = 21 with 1 remainder
21 ÷ 2 = 10 with 1 remainder
10 ÷ 2 = 5 with 0 remainder
5 ÷ 2 = 2 with 1 remainder
2 ÷ 2 = 1 with 0 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 ACED hexadecimal to binary:
ACED hexadecimal = 1010110011101101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
ACEE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact