1. Divide the number repeatedly by 2:
Keep track of each remainder.
We stop when we get a quotient that is equal to zero.
- division = quotient + remainder;
- 964 176 294 ÷ 2 = 482 088 147 + 0;
- 482 088 147 ÷ 2 = 241 044 073 + 1;
- 241 044 073 ÷ 2 = 120 522 036 + 1;
- 120 522 036 ÷ 2 = 60 261 018 + 0;
- 60 261 018 ÷ 2 = 30 130 509 + 0;
- 30 130 509 ÷ 2 = 15 065 254 + 1;
- 15 065 254 ÷ 2 = 7 532 627 + 0;
- 7 532 627 ÷ 2 = 3 766 313 + 1;
- 3 766 313 ÷ 2 = 1 883 156 + 1;
- 1 883 156 ÷ 2 = 941 578 + 0;
- 941 578 ÷ 2 = 470 789 + 0;
- 470 789 ÷ 2 = 235 394 + 1;
- 235 394 ÷ 2 = 117 697 + 0;
- 117 697 ÷ 2 = 58 848 + 1;
- 58 848 ÷ 2 = 29 424 + 0;
- 29 424 ÷ 2 = 14 712 + 0;
- 14 712 ÷ 2 = 7 356 + 0;
- 7 356 ÷ 2 = 3 678 + 0;
- 3 678 ÷ 2 = 1 839 + 0;
- 1 839 ÷ 2 = 919 + 1;
- 919 ÷ 2 = 459 + 1;
- 459 ÷ 2 = 229 + 1;
- 229 ÷ 2 = 114 + 1;
- 114 ÷ 2 = 57 + 0;
- 57 ÷ 2 = 28 + 1;
- 28 ÷ 2 = 14 + 0;
- 14 ÷ 2 = 7 + 0;
- 7 ÷ 2 = 3 + 1;
- 3 ÷ 2 = 1 + 1;
- 1 ÷ 2 = 0 + 1;
2. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
964 176 294(10) = 11 1001 0111 1000 0010 1001 1010 0110(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 30.
- A signed binary's bit length must be equal to a power of 2, as of:
- 21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...
- The first bit (the leftmost) indicates the sign:
- 0 = positive integer number, 1 = negative integer number
The least number that is:
1) a power of 2
2) and is larger than the actual length, 30,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
4. Get the positive binary computer representation on 32 bits (4 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32.
Decimal Number 964 176 294(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.