
Here we will show you how to convert the hexadecimal number E7F2 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 E7F2 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E7F2 by 16⁰, multiply the second to last digit in E7F2 by 16¹, multiply the third to last digit in E7F2 by 16², multiply the fourth to last digit in E7F2 by 16³, and so on, until all the digits are used.
2 × 16⁰ = 2
F × 16¹ = 240
7 × 16² = 1792
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:
2 + 240 + 1792 + 57344 = 59378
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.
59378 ÷ 2 = 29689 with 0 remainder
29689 ÷ 2 = 14844 with 1 remainder
14844 ÷ 2 = 7422 with 0 remainder
7422 ÷ 2 = 3711 with 0 remainder
3711 ÷ 2 = 1855 with 1 remainder
1855 ÷ 2 = 927 with 1 remainder
927 ÷ 2 = 463 with 1 remainder
463 ÷ 2 = 231 with 1 remainder
231 ÷ 2 = 115 with 1 remainder
115 ÷ 2 = 57 with 1 remainder
57 ÷ 2 = 28 with 1 remainder
28 ÷ 2 = 14 with 0 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 E7F2 hexadecimal to binary:
E7F2 hexadecimal = 1110011111110010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E7F3 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
