
Here we will show you how to convert the hexadecimal number D45E 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 D45E from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D45E by 16⁰, multiply the second to last digit in D45E by 16¹, multiply the third to last digit in D45E by 16², multiply the fourth to last digit in D45E by 16³, and so on, until all the digits are used.
E × 16⁰ = 14
5 × 16¹ = 80
4 × 16² = 1024
D × 16³ = 53248
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:
14 + 80 + 1024 + 53248 = 54366
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.
54366 ÷ 2 = 27183 with 0 remainder
27183 ÷ 2 = 13591 with 1 remainder
13591 ÷ 2 = 6795 with 1 remainder
6795 ÷ 2 = 3397 with 1 remainder
3397 ÷ 2 = 1698 with 1 remainder
1698 ÷ 2 = 849 with 0 remainder
849 ÷ 2 = 424 with 1 remainder
424 ÷ 2 = 212 with 0 remainder
212 ÷ 2 = 106 with 0 remainder
106 ÷ 2 = 53 with 0 remainder
53 ÷ 2 = 26 with 1 remainder
26 ÷ 2 = 13 with 0 remainder
13 ÷ 2 = 6 with 1 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 D45E hexadecimal to binary:
D45E hexadecimal = 1101010001011110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D45F hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
