
Here we will show you how to convert the hexadecimal number F0FD 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 F0FD from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F0FD by 16⁰, multiply the second to last digit in F0FD by 16¹, multiply the third to last digit in F0FD by 16², multiply the fourth to last digit in F0FD by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
F × 16¹ = 240
0 × 16² = 0
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:
13 + 240 + 0 + 61440 = 61693
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.
61693 ÷ 2 = 30846 with 1 remainder
30846 ÷ 2 = 15423 with 0 remainder
15423 ÷ 2 = 7711 with 1 remainder
7711 ÷ 2 = 3855 with 1 remainder
3855 ÷ 2 = 1927 with 1 remainder
1927 ÷ 2 = 963 with 1 remainder
963 ÷ 2 = 481 with 1 remainder
481 ÷ 2 = 240 with 1 remainder
240 ÷ 2 = 120 with 0 remainder
120 ÷ 2 = 60 with 0 remainder
60 ÷ 2 = 30 with 0 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 F0FD hexadecimal to binary:
F0FD hexadecimal = 1111000011111101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F0FE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
