
Here we will show you how to convert the hexadecimal number DA5E 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 DA5E from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DA5E by 16⁰, multiply the second to last digit in DA5E by 16¹, multiply the third to last digit in DA5E by 16², multiply the fourth to last digit in DA5E by 16³, and so on, until all the digits are used.
E × 16⁰ = 14
5 × 16¹ = 80
A × 16² = 2560
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 + 2560 + 53248 = 55902
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.
55902 ÷ 2 = 27951 with 0 remainder
27951 ÷ 2 = 13975 with 1 remainder
13975 ÷ 2 = 6987 with 1 remainder
6987 ÷ 2 = 3493 with 1 remainder
3493 ÷ 2 = 1746 with 1 remainder
1746 ÷ 2 = 873 with 0 remainder
873 ÷ 2 = 436 with 1 remainder
436 ÷ 2 = 218 with 0 remainder
218 ÷ 2 = 109 with 0 remainder
109 ÷ 2 = 54 with 1 remainder
54 ÷ 2 = 27 with 0 remainder
27 ÷ 2 = 13 with 1 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 DA5E hexadecimal to binary:
DA5E hexadecimal = 1101101001011110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DA5F hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
