Convert 1 999 999 999 999 999 991 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 1 999 999 999 999 999 991(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
1 999 999 999 999 999 991 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. 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;
  • 1 999 999 999 999 999 991 ÷ 2 = 999 999 999 999 999 995 + 1;
  • 999 999 999 999 999 995 ÷ 2 = 499 999 999 999 999 997 + 1;
  • 499 999 999 999 999 997 ÷ 2 = 249 999 999 999 999 998 + 1;
  • 249 999 999 999 999 998 ÷ 2 = 124 999 999 999 999 999 + 0;
  • 124 999 999 999 999 999 ÷ 2 = 62 499 999 999 999 999 + 1;
  • 62 499 999 999 999 999 ÷ 2 = 31 249 999 999 999 999 + 1;
  • 31 249 999 999 999 999 ÷ 2 = 15 624 999 999 999 999 + 1;
  • 15 624 999 999 999 999 ÷ 2 = 7 812 499 999 999 999 + 1;
  • 7 812 499 999 999 999 ÷ 2 = 3 906 249 999 999 999 + 1;
  • 3 906 249 999 999 999 ÷ 2 = 1 953 124 999 999 999 + 1;
  • 1 953 124 999 999 999 ÷ 2 = 976 562 499 999 999 + 1;
  • 976 562 499 999 999 ÷ 2 = 488 281 249 999 999 + 1;
  • 488 281 249 999 999 ÷ 2 = 244 140 624 999 999 + 1;
  • 244 140 624 999 999 ÷ 2 = 122 070 312 499 999 + 1;
  • 122 070 312 499 999 ÷ 2 = 61 035 156 249 999 + 1;
  • 61 035 156 249 999 ÷ 2 = 30 517 578 124 999 + 1;
  • 30 517 578 124 999 ÷ 2 = 15 258 789 062 499 + 1;
  • 15 258 789 062 499 ÷ 2 = 7 629 394 531 249 + 1;
  • 7 629 394 531 249 ÷ 2 = 3 814 697 265 624 + 1;
  • 3 814 697 265 624 ÷ 2 = 1 907 348 632 812 + 0;
  • 1 907 348 632 812 ÷ 2 = 953 674 316 406 + 0;
  • 953 674 316 406 ÷ 2 = 476 837 158 203 + 0;
  • 476 837 158 203 ÷ 2 = 238 418 579 101 + 1;
  • 238 418 579 101 ÷ 2 = 119 209 289 550 + 1;
  • 119 209 289 550 ÷ 2 = 59 604 644 775 + 0;
  • 59 604 644 775 ÷ 2 = 29 802 322 387 + 1;
  • 29 802 322 387 ÷ 2 = 14 901 161 193 + 1;
  • 14 901 161 193 ÷ 2 = 7 450 580 596 + 1;
  • 7 450 580 596 ÷ 2 = 3 725 290 298 + 0;
  • 3 725 290 298 ÷ 2 = 1 862 645 149 + 0;
  • 1 862 645 149 ÷ 2 = 931 322 574 + 1;
  • 931 322 574 ÷ 2 = 465 661 287 + 0;
  • 465 661 287 ÷ 2 = 232 830 643 + 1;
  • 232 830 643 ÷ 2 = 116 415 321 + 1;
  • 116 415 321 ÷ 2 = 58 207 660 + 1;
  • 58 207 660 ÷ 2 = 29 103 830 + 0;
  • 29 103 830 ÷ 2 = 14 551 915 + 0;
  • 14 551 915 ÷ 2 = 7 275 957 + 1;
  • 7 275 957 ÷ 2 = 3 637 978 + 1;
  • 3 637 978 ÷ 2 = 1 818 989 + 0;
  • 1 818 989 ÷ 2 = 909 494 + 1;
  • 909 494 ÷ 2 = 454 747 + 0;
  • 454 747 ÷ 2 = 227 373 + 1;
  • 227 373 ÷ 2 = 113 686 + 1;
  • 113 686 ÷ 2 = 56 843 + 0;
  • 56 843 ÷ 2 = 28 421 + 1;
  • 28 421 ÷ 2 = 14 210 + 1;
  • 14 210 ÷ 2 = 7 105 + 0;
  • 7 105 ÷ 2 = 3 552 + 1;
  • 3 552 ÷ 2 = 1 776 + 0;
  • 1 776 ÷ 2 = 888 + 0;
  • 888 ÷ 2 = 444 + 0;
  • 444 ÷ 2 = 222 + 0;
  • 222 ÷ 2 = 111 + 0;
  • 111 ÷ 2 = 55 + 1;
  • 55 ÷ 2 = 27 + 1;
  • 27 ÷ 2 = 13 + 1;
  • 13 ÷ 2 = 6 + 1;
  • 6 ÷ 2 = 3 + 0;
  • 3 ÷ 2 = 1 + 1;
  • 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.

1 999 999 999 999 999 991(10) = 1 1011 1100 0001 0110 1101 0110 0111 0100 1110 1100 0111 1111 1111 1111 0111(2)

3. Determine the signed binary number bit length:

  • The base 2 number's actual length, in bits: 61.

  • 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, 61,

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 64.


4. Get the positive binary computer representation on 64 bits (8 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64.


Decimal Number 1 999 999 999 999 999 991(10) converted to signed binary in two's complement representation:

1 999 999 999 999 999 991(10) = 0001 1011 1100 0001 0110 1101 0110 0111 0100 1110 1100 0111 1111 1111 1111 0111

Spaces were used to group digits: for binary, by 4, for decimal, by 3.

Share

» More ops: Convert decimal 1 999 999 999 999 999 957 to signed binary in two's (2's) complement representation

» Calculations Performed by Our Visitors: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Data organized on a Monthly Basis

» Month 04, 2026 [April]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: April - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity and Concealed Intentions. NotebookLM YouTube Video of 6.59 minutes

How to convert signed integers from decimal system to signed binary in two's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in two's complement representation:

  • 1. If the number to be converted is negative, start with the positive version of the number.
  • 2. Divide repeatedly by 2 the positive representation of the integer number, keeping track of each remainder, until we get a quotient that is zero.
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).
  • 4. Binary numbers represented in computer language must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will be 0, correctly representing a positive number.
  • 5. To get the negative integer number representation in signed binary one's complement, replace all 0 bits with 1s and all 1 bits with 0s (reversing the digits).
  • 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

  • 1. Start with the positive version of the number: |-60| = 60
  • 2. Divide repeatedly 60 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 60 ÷ 2 = 30 + 0
    • 30 ÷ 2 = 15 + 0
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 3 ÷ 2 = 1 + 1
    • 1 ÷ 2 = 0 + 1
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:
    60(10) = 11 1100(2)
  • 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
    60(10) = 0011 1100(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
    !(0011 1100) = 1100 0011
  • 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
    -60(10) = 1100 0011 + 1 = 1100 0100
  • Number -60(10), signed integer, converted from decimal system (base 10) to signed binary two's complement representation = 1100 0100