Convert 140 700 520 435 997 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 140 700 520 435 997(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
140 700 520 435 997 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;
  • 140 700 520 435 997 ÷ 2 = 70 350 260 217 998 + 1;
  • 70 350 260 217 998 ÷ 2 = 35 175 130 108 999 + 0;
  • 35 175 130 108 999 ÷ 2 = 17 587 565 054 499 + 1;
  • 17 587 565 054 499 ÷ 2 = 8 793 782 527 249 + 1;
  • 8 793 782 527 249 ÷ 2 = 4 396 891 263 624 + 1;
  • 4 396 891 263 624 ÷ 2 = 2 198 445 631 812 + 0;
  • 2 198 445 631 812 ÷ 2 = 1 099 222 815 906 + 0;
  • 1 099 222 815 906 ÷ 2 = 549 611 407 953 + 0;
  • 549 611 407 953 ÷ 2 = 274 805 703 976 + 1;
  • 274 805 703 976 ÷ 2 = 137 402 851 988 + 0;
  • 137 402 851 988 ÷ 2 = 68 701 425 994 + 0;
  • 68 701 425 994 ÷ 2 = 34 350 712 997 + 0;
  • 34 350 712 997 ÷ 2 = 17 175 356 498 + 1;
  • 17 175 356 498 ÷ 2 = 8 587 678 249 + 0;
  • 8 587 678 249 ÷ 2 = 4 293 839 124 + 1;
  • 4 293 839 124 ÷ 2 = 2 146 919 562 + 0;
  • 2 146 919 562 ÷ 2 = 1 073 459 781 + 0;
  • 1 073 459 781 ÷ 2 = 536 729 890 + 1;
  • 536 729 890 ÷ 2 = 268 364 945 + 0;
  • 268 364 945 ÷ 2 = 134 182 472 + 1;
  • 134 182 472 ÷ 2 = 67 091 236 + 0;
  • 67 091 236 ÷ 2 = 33 545 618 + 0;
  • 33 545 618 ÷ 2 = 16 772 809 + 0;
  • 16 772 809 ÷ 2 = 8 386 404 + 1;
  • 8 386 404 ÷ 2 = 4 193 202 + 0;
  • 4 193 202 ÷ 2 = 2 096 601 + 0;
  • 2 096 601 ÷ 2 = 1 048 300 + 1;
  • 1 048 300 ÷ 2 = 524 150 + 0;
  • 524 150 ÷ 2 = 262 075 + 0;
  • 262 075 ÷ 2 = 131 037 + 1;
  • 131 037 ÷ 2 = 65 518 + 1;
  • 65 518 ÷ 2 = 32 759 + 0;
  • 32 759 ÷ 2 = 16 379 + 1;
  • 16 379 ÷ 2 = 8 189 + 1;
  • 8 189 ÷ 2 = 4 094 + 1;
  • 4 094 ÷ 2 = 2 047 + 0;
  • 2 047 ÷ 2 = 1 023 + 1;
  • 1 023 ÷ 2 = 511 + 1;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 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.

140 700 520 435 997(10) = 111 1111 1111 0111 0110 0100 1000 1010 0101 0001 0001 1101(2)

3. Determine the signed binary number bit length:

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

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

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 140 700 520 435 997(10) converted to signed binary in two's complement representation:

140 700 520 435 997(10) = 0000 0000 0000 0000 0111 1111 1111 0111 0110 0100 1000 1010 0101 0001 0001 1101

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

Share

» More ops: Convert decimal 140 700 520 435 976 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: The Art of Strategic Ambiguity. Gemini Notebook 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