Convert -1 010 000 999 641 to a Signed Binary in Two's (2's) Complement Representation

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

What are the steps to convert decimal number
-1 010 000 999 641 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:

|-1 010 000 999 641| = 1 010 000 999 641

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;
  • 1 010 000 999 641 ÷ 2 = 505 000 499 820 + 1;
  • 505 000 499 820 ÷ 2 = 252 500 249 910 + 0;
  • 252 500 249 910 ÷ 2 = 126 250 124 955 + 0;
  • 126 250 124 955 ÷ 2 = 63 125 062 477 + 1;
  • 63 125 062 477 ÷ 2 = 31 562 531 238 + 1;
  • 31 562 531 238 ÷ 2 = 15 781 265 619 + 0;
  • 15 781 265 619 ÷ 2 = 7 890 632 809 + 1;
  • 7 890 632 809 ÷ 2 = 3 945 316 404 + 1;
  • 3 945 316 404 ÷ 2 = 1 972 658 202 + 0;
  • 1 972 658 202 ÷ 2 = 986 329 101 + 0;
  • 986 329 101 ÷ 2 = 493 164 550 + 1;
  • 493 164 550 ÷ 2 = 246 582 275 + 0;
  • 246 582 275 ÷ 2 = 123 291 137 + 1;
  • 123 291 137 ÷ 2 = 61 645 568 + 1;
  • 61 645 568 ÷ 2 = 30 822 784 + 0;
  • 30 822 784 ÷ 2 = 15 411 392 + 0;
  • 15 411 392 ÷ 2 = 7 705 696 + 0;
  • 7 705 696 ÷ 2 = 3 852 848 + 0;
  • 3 852 848 ÷ 2 = 1 926 424 + 0;
  • 1 926 424 ÷ 2 = 963 212 + 0;
  • 963 212 ÷ 2 = 481 606 + 0;
  • 481 606 ÷ 2 = 240 803 + 0;
  • 240 803 ÷ 2 = 120 401 + 1;
  • 120 401 ÷ 2 = 60 200 + 1;
  • 60 200 ÷ 2 = 30 100 + 0;
  • 30 100 ÷ 2 = 15 050 + 0;
  • 15 050 ÷ 2 = 7 525 + 0;
  • 7 525 ÷ 2 = 3 762 + 1;
  • 3 762 ÷ 2 = 1 881 + 0;
  • 1 881 ÷ 2 = 940 + 1;
  • 940 ÷ 2 = 470 + 0;
  • 470 ÷ 2 = 235 + 0;
  • 235 ÷ 2 = 117 + 1;
  • 117 ÷ 2 = 58 + 1;
  • 58 ÷ 2 = 29 + 0;
  • 29 ÷ 2 = 14 + 1;
  • 14 ÷ 2 = 7 + 0;
  • 7 ÷ 2 = 3 + 1;
  • 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.

1 010 000 999 641(10) = 1110 1011 0010 1000 1100 0000 0011 0100 1101 1001(2)

4. Determine the signed binary number bit length:

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

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

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.


1 010 000 999 641(10) = 0000 0000 0000 0000 0000 0000 1110 1011 0010 1000 1100 0000 0011 0100 1101 1001

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 0000 1110 1011 0010 1000 1100 0000 0011 0100 1101 1001)

= 1111 1111 1111 1111 1111 1111 0001 0100 1101 0111 0011 1111 1100 1011 0010 0110


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 1111 0001 0100 1101 0111 0011 1111 1100 1011 0010 0110 (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):

-1 010 000 999 641 =

1111 1111 1111 1111 1111 1111 0001 0100 1101 0111 0011 1111 1100 1011 0010 0110 + 1


Decimal Number -1 010 000 999 641(10) converted to signed binary in two's complement representation:

-1 010 000 999 641(10) = 1111 1111 1111 1111 1111 1111 0001 0100 1101 0111 0011 1111 1100 1011 0010 0111

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

Share

» More ops: Convert decimal -1 010 000 999 602 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 09, 2026 [September]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: September - by our visitors

» Improve your social skills: Why Do Colleagues From Other Teams Have Better Results? Gemini Notebook YouTube Video of 11.31 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