One's Complement: Integer ↗ Binary: 1 000 000 000 007 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 1 000 000 000 007(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;
  • 1 000 000 000 007 ÷ 2 = 500 000 000 003 + 1;
  • 500 000 000 003 ÷ 2 = 250 000 000 001 + 1;
  • 250 000 000 001 ÷ 2 = 125 000 000 000 + 1;
  • 125 000 000 000 ÷ 2 = 62 500 000 000 + 0;
  • 62 500 000 000 ÷ 2 = 31 250 000 000 + 0;
  • 31 250 000 000 ÷ 2 = 15 625 000 000 + 0;
  • 15 625 000 000 ÷ 2 = 7 812 500 000 + 0;
  • 7 812 500 000 ÷ 2 = 3 906 250 000 + 0;
  • 3 906 250 000 ÷ 2 = 1 953 125 000 + 0;
  • 1 953 125 000 ÷ 2 = 976 562 500 + 0;
  • 976 562 500 ÷ 2 = 488 281 250 + 0;
  • 488 281 250 ÷ 2 = 244 140 625 + 0;
  • 244 140 625 ÷ 2 = 122 070 312 + 1;
  • 122 070 312 ÷ 2 = 61 035 156 + 0;
  • 61 035 156 ÷ 2 = 30 517 578 + 0;
  • 30 517 578 ÷ 2 = 15 258 789 + 0;
  • 15 258 789 ÷ 2 = 7 629 394 + 1;
  • 7 629 394 ÷ 2 = 3 814 697 + 0;
  • 3 814 697 ÷ 2 = 1 907 348 + 1;
  • 1 907 348 ÷ 2 = 953 674 + 0;
  • 953 674 ÷ 2 = 476 837 + 0;
  • 476 837 ÷ 2 = 238 418 + 1;
  • 238 418 ÷ 2 = 119 209 + 0;
  • 119 209 ÷ 2 = 59 604 + 1;
  • 59 604 ÷ 2 = 29 802 + 0;
  • 29 802 ÷ 2 = 14 901 + 0;
  • 14 901 ÷ 2 = 7 450 + 1;
  • 7 450 ÷ 2 = 3 725 + 0;
  • 3 725 ÷ 2 = 1 862 + 1;
  • 1 862 ÷ 2 = 931 + 0;
  • 931 ÷ 2 = 465 + 1;
  • 465 ÷ 2 = 232 + 1;
  • 232 ÷ 2 = 116 + 0;
  • 116 ÷ 2 = 58 + 0;
  • 58 ÷ 2 = 29 + 0;
  • 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 000 000 000 007(10) = 1110 1000 1101 0100 1010 0101 0001 0000 0000 0111(2)


3. Determine the signed binary number bit length:

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

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

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 1 000 000 000 007(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:

1 000 000 000 007(10) = 0000 0000 0000 0000 0000 0000 1110 1000 1101 0100 1010 0101 0001 0000 0000 0111

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 1 000 000 000 006 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 1 000 000 000 008 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 -173,351,224 as a signed binary written in one's complement representation May 20 06:28 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,110,015 as a signed binary written in one's complement representation May 20 06:28 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 58,997 as a signed binary written in one's complement representation May 20 06:28 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -273 as a signed binary written in one's complement representation May 20 06:28 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -306,606,108 as a signed binary written in one's complement representation May 20 06:28 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 671,088,724 as a signed binary written in one's complement representation May 20 06:27 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,110,918 as a signed binary written in one's complement representation May 20 06:27 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,100,101,125 as a signed binary written in one's complement representation May 20 06:27 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -1,073,741,832 as a signed binary written in one's complement representation May 20 06:27 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 589 as a signed binary written in one's complement representation May 20 06:24 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