
Here we will show you how to convert the hexadecimal number 9D4F 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 9D4F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in 9D4F by 16⁰, multiply the second to last digit in 9D4F by 16¹, multiply the third to last digit in 9D4F by 16², multiply the fourth to last digit in 9D4F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
4 × 16¹ = 64
D × 16² = 3328
9 × 16³ = 36864
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:
15 + 64 + 3328 + 36864 = 40271
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.
40271 ÷ 2 = 20135 with 1 remainder
20135 ÷ 2 = 10067 with 1 remainder
10067 ÷ 2 = 5033 with 1 remainder
5033 ÷ 2 = 2516 with 1 remainder
2516 ÷ 2 = 1258 with 0 remainder
1258 ÷ 2 = 629 with 0 remainder
629 ÷ 2 = 314 with 1 remainder
314 ÷ 2 = 157 with 0 remainder
157 ÷ 2 = 78 with 1 remainder
78 ÷ 2 = 39 with 0 remainder
39 ÷ 2 = 19 with 1 remainder
19 ÷ 2 = 9 with 1 remainder
9 ÷ 2 = 4 with 1 remainder
4 ÷ 2 = 2 with 0 remainder
2 ÷ 2 = 1 with 0 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 9D4F hexadecimal to binary:
9D4F hexadecimal = 1001110101001111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
9D50 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
