Convert 1 359 261 608 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 1 359 261 608(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
1 359 261 608 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 359 261 608 ÷ 2 = 679 630 804 + 0;
  • 679 630 804 ÷ 2 = 339 815 402 + 0;
  • 339 815 402 ÷ 2 = 169 907 701 + 0;
  • 169 907 701 ÷ 2 = 84 953 850 + 1;
  • 84 953 850 ÷ 2 = 42 476 925 + 0;
  • 42 476 925 ÷ 2 = 21 238 462 + 1;
  • 21 238 462 ÷ 2 = 10 619 231 + 0;
  • 10 619 231 ÷ 2 = 5 309 615 + 1;
  • 5 309 615 ÷ 2 = 2 654 807 + 1;
  • 2 654 807 ÷ 2 = 1 327 403 + 1;
  • 1 327 403 ÷ 2 = 663 701 + 1;
  • 663 701 ÷ 2 = 331 850 + 1;
  • 331 850 ÷ 2 = 165 925 + 0;
  • 165 925 ÷ 2 = 82 962 + 1;
  • 82 962 ÷ 2 = 41 481 + 0;
  • 41 481 ÷ 2 = 20 740 + 1;
  • 20 740 ÷ 2 = 10 370 + 0;
  • 10 370 ÷ 2 = 5 185 + 0;
  • 5 185 ÷ 2 = 2 592 + 1;
  • 2 592 ÷ 2 = 1 296 + 0;
  • 1 296 ÷ 2 = 648 + 0;
  • 648 ÷ 2 = 324 + 0;
  • 324 ÷ 2 = 162 + 0;
  • 162 ÷ 2 = 81 + 0;
  • 81 ÷ 2 = 40 + 1;
  • 40 ÷ 2 = 20 + 0;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 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.

1 359 261 608(10) = 101 0001 0000 0100 1010 1111 1010 1000(2)

3. Determine the signed binary number bit length:

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

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

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.


Decimal Number 1 359 261 608(10) converted to signed binary in two's complement representation:

1 359 261 608(10) = 0101 0001 0000 0100 1010 1111 1010 1000

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

» More ops: Convert decimal 1 359 261 603 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