-19 119 041 Converted to Signed Binary in Two's (2's) Complement Representation
How to convert decimal number -19 119 041(10) to a signed binary in two's (2's) complement representation
What are the steps to convert decimal number
-19 119 041 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:
|-19 119 041| = 19 119 041
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;
- 19 119 041 ÷ 2 = 9 559 520 + 1;
- 9 559 520 ÷ 2 = 4 779 760 + 0;
- 4 779 760 ÷ 2 = 2 389 880 + 0;
- 2 389 880 ÷ 2 = 1 194 940 + 0;
- 1 194 940 ÷ 2 = 597 470 + 0;
- 597 470 ÷ 2 = 298 735 + 0;
- 298 735 ÷ 2 = 149 367 + 1;
- 149 367 ÷ 2 = 74 683 + 1;
- 74 683 ÷ 2 = 37 341 + 1;
- 37 341 ÷ 2 = 18 670 + 1;
- 18 670 ÷ 2 = 9 335 + 0;
- 9 335 ÷ 2 = 4 667 + 1;
- 4 667 ÷ 2 = 2 333 + 1;
- 2 333 ÷ 2 = 1 166 + 1;
- 1 166 ÷ 2 = 583 + 0;
- 583 ÷ 2 = 291 + 1;
- 291 ÷ 2 = 145 + 1;
- 145 ÷ 2 = 72 + 1;
- 72 ÷ 2 = 36 + 0;
- 36 ÷ 2 = 18 + 0;
- 18 ÷ 2 = 9 + 0;
- 9 ÷ 2 = 4 + 1;
- 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.
19 119 041(10) = 1 0010 0011 1011 1011 1100 0001(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 25.
- 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, 25,
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.
19 119 041(10) = 0000 0001 0010 0011 1011 1011 1100 0001
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 0001 0010 0011 1011 1011 1100 0001)
= 1111 1110 1101 1100 0100 0100 0011 1110
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 1110 1101 1100 0100 0100 0011 1110 (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):
-19 119 041 =
1111 1110 1101 1100 0100 0100 0011 1110 + 1
Decimal Number -19 119 041(10) converted to signed binary in two's complement representation:
-19 119 041(10) = 1111 1110 1101 1100 0100 0100 0011 1111
Spaces were used to group digits: for binary, by 4, for decimal, by 3.