1. Divide the number repeatedly by 2:
Keep track of each remainder.
Stop when you get a quotient that is equal to zero.
- division = quotient + remainder;
- 44 456 ÷ 2 = 22 228 + 0;
- 22 228 ÷ 2 = 11 114 + 0;
- 11 114 ÷ 2 = 5 557 + 0;
- 5 557 ÷ 2 = 2 778 + 1;
- 2 778 ÷ 2 = 1 389 + 0;
- 1 389 ÷ 2 = 694 + 1;
- 694 ÷ 2 = 347 + 0;
- 347 ÷ 2 = 173 + 1;
- 173 ÷ 2 = 86 + 1;
- 86 ÷ 2 = 43 + 0;
- 43 ÷ 2 = 21 + 1;
- 21 ÷ 2 = 10 + 1;
- 10 ÷ 2 = 5 + 0;
- 5 ÷ 2 = 2 + 1;
- 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.
44 456(10) = 1010 1101 1010 1000(2)
3. 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) 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, 16,
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 44 456(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation: