Two's Complement: Integer ↗ Binary: 1 082 130 432 Convert the Integer Number to a Signed Binary in Two's Complement Representation. Write the Base Ten Decimal System Number as a Binary Code (Written in Base Two)

Signed integer number 1 082 130 432(10) converted and written as a signed binary in two's complement representation (base 2) = ?

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 082 130 432 ÷ 2 = 541 065 216 + 0;
  • 541 065 216 ÷ 2 = 270 532 608 + 0;
  • 270 532 608 ÷ 2 = 135 266 304 + 0;
  • 135 266 304 ÷ 2 = 67 633 152 + 0;
  • 67 633 152 ÷ 2 = 33 816 576 + 0;
  • 33 816 576 ÷ 2 = 16 908 288 + 0;
  • 16 908 288 ÷ 2 = 8 454 144 + 0;
  • 8 454 144 ÷ 2 = 4 227 072 + 0;
  • 4 227 072 ÷ 2 = 2 113 536 + 0;
  • 2 113 536 ÷ 2 = 1 056 768 + 0;
  • 1 056 768 ÷ 2 = 528 384 + 0;
  • 528 384 ÷ 2 = 264 192 + 0;
  • 264 192 ÷ 2 = 132 096 + 0;
  • 132 096 ÷ 2 = 66 048 + 0;
  • 66 048 ÷ 2 = 33 024 + 0;
  • 33 024 ÷ 2 = 16 512 + 0;
  • 16 512 ÷ 2 = 8 256 + 0;
  • 8 256 ÷ 2 = 4 128 + 0;
  • 4 128 ÷ 2 = 2 064 + 0;
  • 2 064 ÷ 2 = 1 032 + 0;
  • 1 032 ÷ 2 = 516 + 0;
  • 516 ÷ 2 = 258 + 0;
  • 258 ÷ 2 = 129 + 0;
  • 129 ÷ 2 = 64 + 1;
  • 64 ÷ 2 = 32 + 0;
  • 32 ÷ 2 = 16 + 0;
  • 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.


1 082 130 432(10) = 100 0000 1000 0000 0000 0000 0000 0000(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.


Number 1 082 130 432(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:

1 082 130 432(10) = 0100 0000 1000 0000 0000 0000 0000 0000

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

More operations on integers written as signed binary numbers in two's complement representation:

» Signed integer number 1 082 130 431 converted from decimal system (from base 10) and written as a signed binary in two's complement representation (written in base 2) = ?

» Signed integer number 1 082 130 433 converted from decimal system (from base 10) and written as a signed binary in two's complement representation (written in base 2) = ?

The latest signed integer numbers written in base ten converted from decimal system to binary two's complement representation

Convert and write the signed integer number 21,000 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:44 UTC (GMT)
Convert and write the signed integer number 101,100,100,000,202 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:44 UTC (GMT)
Convert and write the signed integer number 2,366,308,445 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:44 UTC (GMT)
Convert and write the signed integer number 216,631 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:44 UTC (GMT)
Convert and write the signed integer number 452,268 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:44 UTC (GMT)
Convert and write the signed integer number 1,101,100,095 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:43 UTC (GMT)
Convert and write the signed integer number -2,147,023,787 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:43 UTC (GMT)
Convert and write the signed integer number 1,010,101,111,000,119 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:43 UTC (GMT)
Convert and write the signed integer number -4,294,967,298 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:43 UTC (GMT)
Convert and write the signed integer number -56,834 from the decimal system (base 10) to a signed binary in two's complement representation May 17 12:42 UTC (GMT)
All the decimal system integer numbers converted and written as signed binary numbers in two's complement representation

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