
Here we will show you how to convert the hexadecimal number E63D 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 E63D from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E63D by 16⁰, multiply the second to last digit in E63D by 16¹, multiply the third to last digit in E63D by 16², multiply the fourth to last digit in E63D by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
3 × 16¹ = 48
6 × 16² = 1536
E × 16³ = 57344
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 + 48 + 1536 + 57344 = 58941
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.
58941 ÷ 2 = 29470 with 1 remainder
29470 ÷ 2 = 14735 with 0 remainder
14735 ÷ 2 = 7367 with 1 remainder
7367 ÷ 2 = 3683 with 1 remainder
3683 ÷ 2 = 1841 with 1 remainder
1841 ÷ 2 = 920 with 1 remainder
920 ÷ 2 = 460 with 0 remainder
460 ÷ 2 = 230 with 0 remainder
230 ÷ 2 = 115 with 0 remainder
115 ÷ 2 = 57 with 1 remainder
57 ÷ 2 = 28 with 1 remainder
28 ÷ 2 = 14 with 0 remainder
14 ÷ 2 = 7 with 0 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 E63D hexadecimal to binary:
E63D hexadecimal = 1110011000111101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E63E hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
