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;
- 33 802 ÷ 2 = 16 901 + 0;
- 16 901 ÷ 2 = 8 450 + 1;
- 8 450 ÷ 2 = 4 225 + 0;
- 4 225 ÷ 2 = 2 112 + 1;
- 2 112 ÷ 2 = 1 056 + 0;
- 1 056 ÷ 2 = 528 + 0;
- 528 ÷ 2 = 264 + 0;
- 264 ÷ 2 = 132 + 0;
- 132 ÷ 2 = 66 + 0;
- 66 ÷ 2 = 33 + 0;
- 33 ÷ 2 = 16 + 1;
- 16 ÷ 2 = 8 + 0;
- 8 ÷ 2 = 4 + 0;
- 4 ÷ 2 = 2 + 0;
- 2 ÷ 2 = 1 + 0;
- 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.
33 802(10) = 1000 0100 0000 1010(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 16.
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) is reserved for 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, 16,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 32.
5. 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:
33 802(10) = 0000 0000 0000 0000 1000 0100 0000 1010
6. Get the negative integer number representation:
To get the negative integer number representation on 32 bits (4 Bytes),
... change the first bit (the leftmost), from 0 to 1...
Number -33 802(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
-33 802(10) = 1000 0000 0000 0000 1000 0100 0000 1010
Spaces were used to group digits: for binary, by 4, for decimal, by 3.