2. 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;
- 29 270 ÷ 2 = 14 635 + 0;
- 14 635 ÷ 2 = 7 317 + 1;
- 7 317 ÷ 2 = 3 658 + 1;
- 3 658 ÷ 2 = 1 829 + 0;
- 1 829 ÷ 2 = 914 + 1;
- 914 ÷ 2 = 457 + 0;
- 457 ÷ 2 = 228 + 1;
- 228 ÷ 2 = 114 + 0;
- 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;
3. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
29 270(10) = 111 0010 0101 0110(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 15.
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, 15,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 16.
5. Get the positive binary computer representation on 16 bits (2 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 16.
29 270(10) = 0111 0010 0101 0110
6. Get the negative integer number representation. Part 1:
To write the negative integer number on 16 bits (2 Bytes),
as a signed binary in one's complement representation,
... replace all the bits on 0 with 1s and all the bits set on 1 with 0s.
Reverse the digits, flip the digits:
Replace the bits set on 0 with 1s and the bits set on 1 with 0s.
!(0111 0010 0101 0110)
= 1000 1101 1010 1001
7. Get the negative integer number representation. Part 2:
To write the negative integer number on 16 bits (2 Bytes),
as a signed binary in two's complement representation,
add 1 to the number calculated above
1000 1101 1010 1001
(to the signed binary in one's complement representation)
Binary addition carries on a value of 2:
0 + 0 = 0
0 + 1 = 1
1 + 1 = 10
1 + 10 = 11
1 + 11 = 100
Add 1 to the number calculated above
(to the signed binary number in one's complement representation):
-29 270 =
1000 1101 1010 1001 + 1
Number -29 270(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in two's complement representation:
-29 270(10) = 1000 1101 1010 1010
Spaces were used to group digits: for binary, by 4, for decimal, by 3.