Convert -841 759 to a Signed Binary in Two's (2's) Complement Representation
How to convert decimal number -841 759(10) to a signed binary in two's (2's) complement representation
What are the steps to convert decimal number
-841 759 to a signed binary in two's (2's) complement representation?
- A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.
1. Start with the positive version of the number:
|-841 759| = 841 759
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;
- 841 759 ÷ 2 = 420 879 + 1;
- 420 879 ÷ 2 = 210 439 + 1;
- 210 439 ÷ 2 = 105 219 + 1;
- 105 219 ÷ 2 = 52 609 + 1;
- 52 609 ÷ 2 = 26 304 + 1;
- 26 304 ÷ 2 = 13 152 + 0;
- 13 152 ÷ 2 = 6 576 + 0;
- 6 576 ÷ 2 = 3 288 + 0;
- 3 288 ÷ 2 = 1 644 + 0;
- 1 644 ÷ 2 = 822 + 0;
- 822 ÷ 2 = 411 + 0;
- 411 ÷ 2 = 205 + 1;
- 205 ÷ 2 = 102 + 1;
- 102 ÷ 2 = 51 + 0;
- 51 ÷ 2 = 25 + 1;
- 25 ÷ 2 = 12 + 1;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 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.
841 759(10) = 1100 1101 1000 0001 1111(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 20.
- 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, 20,
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.
841 759(10) = 0000 0000 0000 1100 1101 1000 0001 1111
6. Get the negative integer number representation. Part 1:
- To write the negative integer number on 32 bits (4 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.
!(0000 0000 0000 1100 1101 1000 0001 1111)
= 1111 1111 1111 0011 0010 0111 1110 0000
7. Get the negative integer number representation. Part 2:
- To write the negative integer number on 32 bits (4 Bytes), as a signed binary in two's complement representation, add 1 to the number calculated above 1111 1111 1111 0011 0010 0111 1110 0000 (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):
-841 759 =
1111 1111 1111 0011 0010 0111 1110 0000 + 1
Decimal Number -841 759(10) converted to signed binary in two's complement representation:
-841 759(10) = 1111 1111 1111 0011 0010 0111 1110 0001
Spaces were used to group digits: for binary, by 4, for decimal, by 3.