Two's Complement: Integer ↗ Binary: 805 306 427 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 805 306 427(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;
  • 805 306 427 ÷ 2 = 402 653 213 + 1;
  • 402 653 213 ÷ 2 = 201 326 606 + 1;
  • 201 326 606 ÷ 2 = 100 663 303 + 0;
  • 100 663 303 ÷ 2 = 50 331 651 + 1;
  • 50 331 651 ÷ 2 = 25 165 825 + 1;
  • 25 165 825 ÷ 2 = 12 582 912 + 1;
  • 12 582 912 ÷ 2 = 6 291 456 + 0;
  • 6 291 456 ÷ 2 = 3 145 728 + 0;
  • 3 145 728 ÷ 2 = 1 572 864 + 0;
  • 1 572 864 ÷ 2 = 786 432 + 0;
  • 786 432 ÷ 2 = 393 216 + 0;
  • 393 216 ÷ 2 = 196 608 + 0;
  • 196 608 ÷ 2 = 98 304 + 0;
  • 98 304 ÷ 2 = 49 152 + 0;
  • 49 152 ÷ 2 = 24 576 + 0;
  • 24 576 ÷ 2 = 12 288 + 0;
  • 12 288 ÷ 2 = 6 144 + 0;
  • 6 144 ÷ 2 = 3 072 + 0;
  • 3 072 ÷ 2 = 1 536 + 0;
  • 1 536 ÷ 2 = 768 + 0;
  • 768 ÷ 2 = 384 + 0;
  • 384 ÷ 2 = 192 + 0;
  • 192 ÷ 2 = 96 + 0;
  • 96 ÷ 2 = 48 + 0;
  • 48 ÷ 2 = 24 + 0;
  • 24 ÷ 2 = 12 + 0;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 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.


805 306 427(10) = 11 0000 0000 0000 0000 0000 0011 1011(2)


3. Determine the signed binary number bit length:

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


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

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 805 306 427(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:

805 306 427(10) = 0011 0000 0000 0000 0000 0000 0011 1011

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

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 18,961 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:33 UTC (GMT)
Convert and write the signed integer number 18,969 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:33 UTC (GMT)
Convert and write the signed integer number -2,678 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number -109 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number 5,646,473,765,376,358,704 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number 11,100,992 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number 28,747 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number 400,556,046 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number 922,342,955 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 UTC (GMT)
Convert and write the signed integer number 157,239,824 from the decimal system (base 10) to a signed binary in two's complement representation Jun 17 16:32 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