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;
- 4 211 455 ÷ 2 = 2 105 727 + 1;
- 2 105 727 ÷ 2 = 1 052 863 + 1;
- 1 052 863 ÷ 2 = 526 431 + 1;
- 526 431 ÷ 2 = 263 215 + 1;
- 263 215 ÷ 2 = 131 607 + 1;
- 131 607 ÷ 2 = 65 803 + 1;
- 65 803 ÷ 2 = 32 901 + 1;
- 32 901 ÷ 2 = 16 450 + 1;
- 16 450 ÷ 2 = 8 225 + 0;
- 8 225 ÷ 2 = 4 112 + 1;
- 4 112 ÷ 2 = 2 056 + 0;
- 2 056 ÷ 2 = 1 028 + 0;
- 1 028 ÷ 2 = 514 + 0;
- 514 ÷ 2 = 257 + 0;
- 257 ÷ 2 = 128 + 1;
- 128 ÷ 2 = 64 + 0;
- 64 ÷ 2 = 32 + 0;
- 32 ÷ 2 = 16 + 0;
- 16 ÷ 2 = 8 + 0;
- 8 ÷ 2 = 4 + 0;
- 4 ÷ 2 = 2 + 0;
- 2 ÷ 2 = 1 + 0;
- 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.
4 211 455(10) = 100 0000 0100 0010 1111 1111(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 23.
- 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, 23,
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 4 211 455(10) converted to signed binary in two's complement representation:
Spaces were used to group digits: for binary, by 4, for decimal, by 3.