
Here we will show you how to convert the hexadecimal number FD61 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 FD61 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in FD61 by 16⁰, multiply the second to last digit in FD61 by 16¹, multiply the third to last digit in FD61 by 16², multiply the fourth to last digit in FD61 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
6 × 16¹ = 96
D × 16² = 3328
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:
1 + 96 + 3328 + 61440 = 64865
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.
64865 ÷ 2 = 32432 with 1 remainder
32432 ÷ 2 = 16216 with 0 remainder
16216 ÷ 2 = 8108 with 0 remainder
8108 ÷ 2 = 4054 with 0 remainder
4054 ÷ 2 = 2027 with 0 remainder
2027 ÷ 2 = 1013 with 1 remainder
1013 ÷ 2 = 506 with 1 remainder
506 ÷ 2 = 253 with 0 remainder
253 ÷ 2 = 126 with 1 remainder
126 ÷ 2 = 63 with 0 remainder
63 ÷ 2 = 31 with 1 remainder
31 ÷ 2 = 15 with 1 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 FD61 hexadecimal to binary:
FD61 hexadecimal = 1111110101100001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
FD62 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
