
Here we will show you how to convert the hexadecimal number ED3D 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 ED3D from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in ED3D by 16⁰, multiply the second to last digit in ED3D by 16¹, multiply the third to last digit in ED3D by 16², multiply the fourth to last digit in ED3D by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
3 × 16¹ = 48
D × 16² = 3328
E × 16³ = 57344
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 + 48 + 3328 + 57344 = 60733
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.
60733 ÷ 2 = 30366 with 1 remainder
30366 ÷ 2 = 15183 with 0 remainder
15183 ÷ 2 = 7591 with 1 remainder
7591 ÷ 2 = 3795 with 1 remainder
3795 ÷ 2 = 1897 with 1 remainder
1897 ÷ 2 = 948 with 1 remainder
948 ÷ 2 = 474 with 0 remainder
474 ÷ 2 = 237 with 0 remainder
237 ÷ 2 = 118 with 1 remainder
118 ÷ 2 = 59 with 0 remainder
59 ÷ 2 = 29 with 1 remainder
29 ÷ 2 = 14 with 1 remainder
14 ÷ 2 = 7 with 0 remainder
7 ÷ 2 = 3 with 1 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 ED3D hexadecimal to binary:
ED3D hexadecimal = 1110110100111101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
ED3E hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
