One's Complement: Integer ↗ Binary: 100 000 001 005 Convert the Integer Number to a Signed Binary in One's Complement Representation. Write the Base Ten Decimal System Number as a Binary Code (Written in Base Two)

Signed integer number 100 000 001 005(10) converted and written as a signed binary in one'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;
  • 100 000 001 005 ÷ 2 = 50 000 000 502 + 1;
  • 50 000 000 502 ÷ 2 = 25 000 000 251 + 0;
  • 25 000 000 251 ÷ 2 = 12 500 000 125 + 1;
  • 12 500 000 125 ÷ 2 = 6 250 000 062 + 1;
  • 6 250 000 062 ÷ 2 = 3 125 000 031 + 0;
  • 3 125 000 031 ÷ 2 = 1 562 500 015 + 1;
  • 1 562 500 015 ÷ 2 = 781 250 007 + 1;
  • 781 250 007 ÷ 2 = 390 625 003 + 1;
  • 390 625 003 ÷ 2 = 195 312 501 + 1;
  • 195 312 501 ÷ 2 = 97 656 250 + 1;
  • 97 656 250 ÷ 2 = 48 828 125 + 0;
  • 48 828 125 ÷ 2 = 24 414 062 + 1;
  • 24 414 062 ÷ 2 = 12 207 031 + 0;
  • 12 207 031 ÷ 2 = 6 103 515 + 1;
  • 6 103 515 ÷ 2 = 3 051 757 + 1;
  • 3 051 757 ÷ 2 = 1 525 878 + 1;
  • 1 525 878 ÷ 2 = 762 939 + 0;
  • 762 939 ÷ 2 = 381 469 + 1;
  • 381 469 ÷ 2 = 190 734 + 1;
  • 190 734 ÷ 2 = 95 367 + 0;
  • 95 367 ÷ 2 = 47 683 + 1;
  • 47 683 ÷ 2 = 23 841 + 1;
  • 23 841 ÷ 2 = 11 920 + 1;
  • 11 920 ÷ 2 = 5 960 + 0;
  • 5 960 ÷ 2 = 2 980 + 0;
  • 2 980 ÷ 2 = 1 490 + 0;
  • 1 490 ÷ 2 = 745 + 0;
  • 745 ÷ 2 = 372 + 1;
  • 372 ÷ 2 = 186 + 0;
  • 186 ÷ 2 = 93 + 0;
  • 93 ÷ 2 = 46 + 1;
  • 46 ÷ 2 = 23 + 0;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 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.


100 000 001 005(10) = 1 0111 0100 1000 0111 0110 1110 1011 1110 1101(2)


3. Determine the signed binary number bit length:

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

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

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

=== is: 64.


4. Get the positive binary computer representation on 64 bits (8 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64.


Number 100 000 001 005(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:

100 000 001 005(10) = 0000 0000 0000 0000 0000 0000 0001 0111 0100 1000 0111 0110 1110 1011 1110 1101

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

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

» Signed integer number 100 000 001 004 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

» Signed integer number 100 000 001 006 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

The latest signed integer numbers converted from decimal system (base ten) and written as signed binary in one's complement representation

Convert and write the decimal system (base 10) signed integer number -81 as a signed binary written in one's complement representation May 19 22:05 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 780 as a signed binary written in one's complement representation May 19 22:05 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -799 as a signed binary written in one's complement representation May 19 22:05 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 15,426 as a signed binary written in one's complement representation May 19 22:05 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 523 as a signed binary written in one's complement representation May 19 22:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 4,171 as a signed binary written in one's complement representation May 19 22:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 111,100,998 as a signed binary written in one's complement representation May 19 22:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 2,397 as a signed binary written in one's complement representation May 19 22:01 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,110,101,010,011,008 as a signed binary written in one's complement representation May 19 21:59 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,003 as a signed binary written in one's complement representation May 19 21:59 UTC (GMT)
All the decimal integer numbers converted and written as signed binary numbers in one's complement representation

How to convert signed integers from the decimal system to signed binary in one's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in one'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 that is to be converted to binary, keeping track of each remainder, until we get a quotient that is equal to 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, fill in '0' bits in front (to the left) of the base 2 number calculated above, up to the right length; this way the first bit (leftmost) will always 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 '1's and all '1' bits with '0's.

Example: convert the negative number -49 from the decimal system (base ten) to signed binary one's complement:

  • 1. Start with the positive version of the number: |-49| = 49
  • 2. Divide repeatedly 49 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 49 ÷ 2 = 24 + 1
    • 24 ÷ 2 = 12 + 0
    • 12 ÷ 2 = 6 + 0
    • 6 ÷ 2 = 3 + 0
    • 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:
    49(10) = 11 0001(2)
  • 4. The actual bit length of base 2 representation is 6, so the positive binary computer representation of a signed binary will take in this case 8 bits (the least power of 2 that is larger than 6) - add '0's in front of the base 2 number, up to the required length:
    49(10) = 0011 0001(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's:
    -49(10) = 1100 1110
  • Number -49(10), signed integer, converted from the decimal system (base 10) to signed binary in one's complement representation = 1100 1110