Integer as Two's Complement Binary: Number 17 640 626 Converted and Written as a Signed Binary in Two's Complement Representation

Integer number 17 640 626(10) written as a signed binary in two's complement representation

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;
  • 17 640 626 ÷ 2 = 8 820 313 + 0;
  • 8 820 313 ÷ 2 = 4 410 156 + 1;
  • 4 410 156 ÷ 2 = 2 205 078 + 0;
  • 2 205 078 ÷ 2 = 1 102 539 + 0;
  • 1 102 539 ÷ 2 = 551 269 + 1;
  • 551 269 ÷ 2 = 275 634 + 1;
  • 275 634 ÷ 2 = 137 817 + 0;
  • 137 817 ÷ 2 = 68 908 + 1;
  • 68 908 ÷ 2 = 34 454 + 0;
  • 34 454 ÷ 2 = 17 227 + 0;
  • 17 227 ÷ 2 = 8 613 + 1;
  • 8 613 ÷ 2 = 4 306 + 1;
  • 4 306 ÷ 2 = 2 153 + 0;
  • 2 153 ÷ 2 = 1 076 + 1;
  • 1 076 ÷ 2 = 538 + 0;
  • 538 ÷ 2 = 269 + 0;
  • 269 ÷ 2 = 134 + 1;
  • 134 ÷ 2 = 67 + 0;
  • 67 ÷ 2 = 33 + 1;
  • 33 ÷ 2 = 16 + 1;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 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.


17 640 626(10) = 1 0000 1101 0010 1100 1011 0010(2)


3. Determine the signed binary number bit length:

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

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, 25,

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

=== is: 32.


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


Number 17 640 626(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in two's complement representation:

17 640 626(10) = 0000 0001 0000 1101 0010 1100 1011 0010

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

» More ops: Integer number 17 640 615 converted and written as a signed binary in two's complement representation

» New: All the Calculations Performed by Our Visitors: Integer numbers converted and written as signed binary in two's complement representation. Data organized on a Monthly Basis

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