
Here we will show you how to convert the hexadecimal number EF4C 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 EF4C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in EF4C by 16⁰, multiply the second to last digit in EF4C by 16¹, multiply the third to last digit in EF4C by 16², multiply the fourth to last digit in EF4C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
4 × 16¹ = 64
F × 16² = 3840
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:
12 + 64 + 3840 + 57344 = 61260
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.
61260 ÷ 2 = 30630 with 0 remainder
30630 ÷ 2 = 15315 with 0 remainder
15315 ÷ 2 = 7657 with 1 remainder
7657 ÷ 2 = 3828 with 1 remainder
3828 ÷ 2 = 1914 with 0 remainder
1914 ÷ 2 = 957 with 0 remainder
957 ÷ 2 = 478 with 1 remainder
478 ÷ 2 = 239 with 0 remainder
239 ÷ 2 = 119 with 1 remainder
119 ÷ 2 = 59 with 1 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 EF4C hexadecimal to binary:
EF4C hexadecimal = 1110111101001100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
EF4D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
