
Here we will show you how to convert the hexadecimal number E697 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 E697 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E697 by 16⁰, multiply the second to last digit in E697 by 16¹, multiply the third to last digit in E697 by 16², multiply the fourth to last digit in E697 by 16³, and so on, until all the digits are used.
7 × 16⁰ = 7
9 × 16¹ = 144
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:
7 + 144 + 1536 + 57344 = 59031
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.
59031 ÷ 2 = 29515 with 1 remainder
29515 ÷ 2 = 14757 with 1 remainder
14757 ÷ 2 = 7378 with 1 remainder
7378 ÷ 2 = 3689 with 0 remainder
3689 ÷ 2 = 1844 with 1 remainder
1844 ÷ 2 = 922 with 0 remainder
922 ÷ 2 = 461 with 0 remainder
461 ÷ 2 = 230 with 1 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 E697 hexadecimal to binary:
E697 hexadecimal = 1110011010010111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E698 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact