Convert -7 158 278 900 773 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number -7 158 278 900 773(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
-7 158 278 900 773 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:

|-7 158 278 900 773| = 7 158 278 900 773

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;
  • 7 158 278 900 773 ÷ 2 = 3 579 139 450 386 + 1;
  • 3 579 139 450 386 ÷ 2 = 1 789 569 725 193 + 0;
  • 1 789 569 725 193 ÷ 2 = 894 784 862 596 + 1;
  • 894 784 862 596 ÷ 2 = 447 392 431 298 + 0;
  • 447 392 431 298 ÷ 2 = 223 696 215 649 + 0;
  • 223 696 215 649 ÷ 2 = 111 848 107 824 + 1;
  • 111 848 107 824 ÷ 2 = 55 924 053 912 + 0;
  • 55 924 053 912 ÷ 2 = 27 962 026 956 + 0;
  • 27 962 026 956 ÷ 2 = 13 981 013 478 + 0;
  • 13 981 013 478 ÷ 2 = 6 990 506 739 + 0;
  • 6 990 506 739 ÷ 2 = 3 495 253 369 + 1;
  • 3 495 253 369 ÷ 2 = 1 747 626 684 + 1;
  • 1 747 626 684 ÷ 2 = 873 813 342 + 0;
  • 873 813 342 ÷ 2 = 436 906 671 + 0;
  • 436 906 671 ÷ 2 = 218 453 335 + 1;
  • 218 453 335 ÷ 2 = 109 226 667 + 1;
  • 109 226 667 ÷ 2 = 54 613 333 + 1;
  • 54 613 333 ÷ 2 = 27 306 666 + 1;
  • 27 306 666 ÷ 2 = 13 653 333 + 0;
  • 13 653 333 ÷ 2 = 6 826 666 + 1;
  • 6 826 666 ÷ 2 = 3 413 333 + 0;
  • 3 413 333 ÷ 2 = 1 706 666 + 1;
  • 1 706 666 ÷ 2 = 853 333 + 0;
  • 853 333 ÷ 2 = 426 666 + 1;
  • 426 666 ÷ 2 = 213 333 + 0;
  • 213 333 ÷ 2 = 106 666 + 1;
  • 106 666 ÷ 2 = 53 333 + 0;
  • 53 333 ÷ 2 = 26 666 + 1;
  • 26 666 ÷ 2 = 13 333 + 0;
  • 13 333 ÷ 2 = 6 666 + 1;
  • 6 666 ÷ 2 = 3 333 + 0;
  • 3 333 ÷ 2 = 1 666 + 1;
  • 1 666 ÷ 2 = 833 + 0;
  • 833 ÷ 2 = 416 + 1;
  • 416 ÷ 2 = 208 + 0;
  • 208 ÷ 2 = 104 + 0;
  • 104 ÷ 2 = 52 + 0;
  • 52 ÷ 2 = 26 + 0;
  • 26 ÷ 2 = 13 + 0;
  • 13 ÷ 2 = 6 + 1;
  • 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.

7 158 278 900 773(10) = 110 1000 0010 1010 1010 1010 1011 1100 1100 0010 0101(2)

4. Determine the signed binary number bit length:

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

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

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

=== is: 64.


5. 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.


7 158 278 900 773(10) = 0000 0000 0000 0000 0000 0110 1000 0010 1010 1010 1010 1011 1100 1100 0010 0101

6. Get the negative integer number representation. Part 1:

  • To write the negative integer number on 64 bits (8 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 0000 0000 0110 1000 0010 1010 1010 1010 1011 1100 1100 0010 0101)

= 1111 1111 1111 1111 1111 1001 0111 1101 0101 0101 0101 0100 0011 0011 1101 1010


7. Get the negative integer number representation. Part 2:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in two's complement representation, add 1 to the number calculated above 1111 1111 1111 1111 1111 1001 0111 1101 0101 0101 0101 0100 0011 0011 1101 1010 (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):

-7 158 278 900 773 =

1111 1111 1111 1111 1111 1001 0111 1101 0101 0101 0101 0100 0011 0011 1101 1010 + 1


Decimal Number -7 158 278 900 773(10) converted to signed binary in two's complement representation:

-7 158 278 900 773(10) = 1111 1111 1111 1111 1111 1001 0111 1101 0101 0101 0101 0100 0011 0011 1101 1011

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

» More ops: Convert decimal -7 158 278 900 751 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 10, 2026 [October]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: October - by our visitors

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