One's Complement: Integer ↗ Binary: 101 001 101 175 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 101 001 101 175(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;
  • 101 001 101 175 ÷ 2 = 50 500 550 587 + 1;
  • 50 500 550 587 ÷ 2 = 25 250 275 293 + 1;
  • 25 250 275 293 ÷ 2 = 12 625 137 646 + 1;
  • 12 625 137 646 ÷ 2 = 6 312 568 823 + 0;
  • 6 312 568 823 ÷ 2 = 3 156 284 411 + 1;
  • 3 156 284 411 ÷ 2 = 1 578 142 205 + 1;
  • 1 578 142 205 ÷ 2 = 789 071 102 + 1;
  • 789 071 102 ÷ 2 = 394 535 551 + 0;
  • 394 535 551 ÷ 2 = 197 267 775 + 1;
  • 197 267 775 ÷ 2 = 98 633 887 + 1;
  • 98 633 887 ÷ 2 = 49 316 943 + 1;
  • 49 316 943 ÷ 2 = 24 658 471 + 1;
  • 24 658 471 ÷ 2 = 12 329 235 + 1;
  • 12 329 235 ÷ 2 = 6 164 617 + 1;
  • 6 164 617 ÷ 2 = 3 082 308 + 1;
  • 3 082 308 ÷ 2 = 1 541 154 + 0;
  • 1 541 154 ÷ 2 = 770 577 + 0;
  • 770 577 ÷ 2 = 385 288 + 1;
  • 385 288 ÷ 2 = 192 644 + 0;
  • 192 644 ÷ 2 = 96 322 + 0;
  • 96 322 ÷ 2 = 48 161 + 0;
  • 48 161 ÷ 2 = 24 080 + 1;
  • 24 080 ÷ 2 = 12 040 + 0;
  • 12 040 ÷ 2 = 6 020 + 0;
  • 6 020 ÷ 2 = 3 010 + 0;
  • 3 010 ÷ 2 = 1 505 + 0;
  • 1 505 ÷ 2 = 752 + 1;
  • 752 ÷ 2 = 376 + 0;
  • 376 ÷ 2 = 188 + 0;
  • 188 ÷ 2 = 94 + 0;
  • 94 ÷ 2 = 47 + 0;
  • 47 ÷ 2 = 23 + 1;
  • 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.


101 001 101 175(10) = 1 0111 1000 0100 0010 0010 0111 1111 0111 0111(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 101 001 101 175(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:

101 001 101 175(10) = 0000 0000 0000 0000 0000 0000 0001 0111 1000 0100 0010 0010 0111 1111 0111 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 101 001 101 174 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 101 001 101 176 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 -134,216,705 as a signed binary written in one's complement representation May 21 22:34 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,255 as a signed binary written in one's complement representation May 21 22:34 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 21,474,876 as a signed binary written in one's complement representation May 21 22:33 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,100,110,180 as a signed binary written in one's complement representation May 21 22:33 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 10,009 as a signed binary written in one's complement representation May 21 22:33 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,364,214 as a signed binary written in one's complement representation May 21 22:32 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,010,110,923 as a signed binary written in one's complement representation May 21 22:31 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,200,519 as a signed binary written in one's complement representation May 21 22:31 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -16,752 as a signed binary written in one's complement representation May 21 22:31 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 3,593 as a signed binary written in one's complement representation May 21 22:30 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