Integer as Two's Complement Binary: Number 1 001 011 013 Converted and Written as a Signed Binary in Two's Complement Representation

Integer number 1 001 011 013(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;
  • 1 001 011 013 ÷ 2 = 500 505 506 + 1;
  • 500 505 506 ÷ 2 = 250 252 753 + 0;
  • 250 252 753 ÷ 2 = 125 126 376 + 1;
  • 125 126 376 ÷ 2 = 62 563 188 + 0;
  • 62 563 188 ÷ 2 = 31 281 594 + 0;
  • 31 281 594 ÷ 2 = 15 640 797 + 0;
  • 15 640 797 ÷ 2 = 7 820 398 + 1;
  • 7 820 398 ÷ 2 = 3 910 199 + 0;
  • 3 910 199 ÷ 2 = 1 955 099 + 1;
  • 1 955 099 ÷ 2 = 977 549 + 1;
  • 977 549 ÷ 2 = 488 774 + 1;
  • 488 774 ÷ 2 = 244 387 + 0;
  • 244 387 ÷ 2 = 122 193 + 1;
  • 122 193 ÷ 2 = 61 096 + 1;
  • 61 096 ÷ 2 = 30 548 + 0;
  • 30 548 ÷ 2 = 15 274 + 0;
  • 15 274 ÷ 2 = 7 637 + 0;
  • 7 637 ÷ 2 = 3 818 + 1;
  • 3 818 ÷ 2 = 1 909 + 0;
  • 1 909 ÷ 2 = 954 + 1;
  • 954 ÷ 2 = 477 + 0;
  • 477 ÷ 2 = 238 + 1;
  • 238 ÷ 2 = 119 + 0;
  • 119 ÷ 2 = 59 + 1;
  • 59 ÷ 2 = 29 + 1;
  • 29 ÷ 2 = 14 + 1;
  • 14 ÷ 2 = 7 + 0;
  • 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.


1 001 011 013(10) = 11 1011 1010 1010 0011 0111 0100 0101(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 1 001 011 013(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 001 011 013(10) = 0011 1011 1010 1010 0011 0111 0100 0101

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

» More ops: Integer number 1 001 011 060 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