What are the required steps to convert base 10 integer
number -1 272 919 270 to signed binary code (in base 2)?
- 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:
|-1 272 919 270| = 1 272 919 270
2. 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;
- 1 272 919 270 ÷ 2 = 636 459 635 + 0;
- 636 459 635 ÷ 2 = 318 229 817 + 1;
- 318 229 817 ÷ 2 = 159 114 908 + 1;
- 159 114 908 ÷ 2 = 79 557 454 + 0;
- 79 557 454 ÷ 2 = 39 778 727 + 0;
- 39 778 727 ÷ 2 = 19 889 363 + 1;
- 19 889 363 ÷ 2 = 9 944 681 + 1;
- 9 944 681 ÷ 2 = 4 972 340 + 1;
- 4 972 340 ÷ 2 = 2 486 170 + 0;
- 2 486 170 ÷ 2 = 1 243 085 + 0;
- 1 243 085 ÷ 2 = 621 542 + 1;
- 621 542 ÷ 2 = 310 771 + 0;
- 310 771 ÷ 2 = 155 385 + 1;
- 155 385 ÷ 2 = 77 692 + 1;
- 77 692 ÷ 2 = 38 846 + 0;
- 38 846 ÷ 2 = 19 423 + 0;
- 19 423 ÷ 2 = 9 711 + 1;
- 9 711 ÷ 2 = 4 855 + 1;
- 4 855 ÷ 2 = 2 427 + 1;
- 2 427 ÷ 2 = 1 213 + 1;
- 1 213 ÷ 2 = 606 + 1;
- 606 ÷ 2 = 303 + 0;
- 303 ÷ 2 = 151 + 1;
- 151 ÷ 2 = 75 + 1;
- 75 ÷ 2 = 37 + 1;
- 37 ÷ 2 = 18 + 1;
- 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.
1 272 919 270(10) = 100 1011 1101 1111 0011 0100 1110 0110(2)
4. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 31.
- 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, 31,
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:
1 272 919 270(10) = 0100 1011 1101 1111 0011 0100 1110 0110
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...
-1 272 919 270(10) Base 10 integer number converted and written as a signed binary code (in base 2):
-1 272 919 270(10) = 1100 1011 1101 1111 0011 0100 1110 0110
Spaces were used to group digits: for binary, by 4, for decimal, by 3.