
Here we will show you how to convert the hexadecimal number F66E 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 F66E from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F66E by 16⁰, multiply the second to last digit in F66E by 16¹, multiply the third to last digit in F66E by 16², multiply the fourth to last digit in F66E by 16³, and so on, until all the digits are used.
E × 16⁰ = 14
6 × 16¹ = 96
6 × 16² = 1536
F × 16³ = 61440
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 + 96 + 1536 + 61440 = 63086
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.
63086 ÷ 2 = 31543 with 0 remainder
31543 ÷ 2 = 15771 with 1 remainder
15771 ÷ 2 = 7885 with 1 remainder
7885 ÷ 2 = 3942 with 1 remainder
3942 ÷ 2 = 1971 with 0 remainder
1971 ÷ 2 = 985 with 1 remainder
985 ÷ 2 = 492 with 1 remainder
492 ÷ 2 = 246 with 0 remainder
246 ÷ 2 = 123 with 0 remainder
123 ÷ 2 = 61 with 1 remainder
61 ÷ 2 = 30 with 1 remainder
30 ÷ 2 = 15 with 0 remainder
15 ÷ 2 = 7 with 1 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 F66E hexadecimal to binary:
F66E hexadecimal = 1111011001101110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F66F hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
