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;
- 76 579 ÷ 2 = 38 289 + 1;
- 38 289 ÷ 2 = 19 144 + 1;
- 19 144 ÷ 2 = 9 572 + 0;
- 9 572 ÷ 2 = 4 786 + 0;
- 4 786 ÷ 2 = 2 393 + 0;
- 2 393 ÷ 2 = 1 196 + 1;
- 1 196 ÷ 2 = 598 + 0;
- 598 ÷ 2 = 299 + 0;
- 299 ÷ 2 = 149 + 1;
- 149 ÷ 2 = 74 + 1;
- 74 ÷ 2 = 37 + 0;
- 37 ÷ 2 = 18 + 1;
- 18 ÷ 2 = 9 + 0;
- 9 ÷ 2 = 4 + 1;
- 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.
76 579(10) = 1 0010 1011 0010 0011(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 17.
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, 17,
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:
Number 76 579(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
76 579(10) = 0000 0000 0000 0001 0010 1011 0010 0011
Spaces were used to group digits: for binary, by 4, for decimal, by 3.