
Here we will show you how to convert the hexadecimal number F93C 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 F93C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F93C by 16⁰, multiply the second to last digit in F93C by 16¹, multiply the third to last digit in F93C by 16², multiply the fourth to last digit in F93C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
3 × 16¹ = 48
9 × 16² = 2304
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:
12 + 48 + 2304 + 61440 = 63804
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.
63804 ÷ 2 = 31902 with 0 remainder
31902 ÷ 2 = 15951 with 0 remainder
15951 ÷ 2 = 7975 with 1 remainder
7975 ÷ 2 = 3987 with 1 remainder
3987 ÷ 2 = 1993 with 1 remainder
1993 ÷ 2 = 996 with 1 remainder
996 ÷ 2 = 498 with 0 remainder
498 ÷ 2 = 249 with 0 remainder
249 ÷ 2 = 124 with 1 remainder
124 ÷ 2 = 62 with 0 remainder
62 ÷ 2 = 31 with 0 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 F93C hexadecimal to binary:
F93C hexadecimal = 1111100100111100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F93D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
