One's Complement: Integer ↗ Binary: 1 869 983 342 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 869 983 342(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 869 983 342 ÷ 2 = 934 991 671 + 0;
  • 934 991 671 ÷ 2 = 467 495 835 + 1;
  • 467 495 835 ÷ 2 = 233 747 917 + 1;
  • 233 747 917 ÷ 2 = 116 873 958 + 1;
  • 116 873 958 ÷ 2 = 58 436 979 + 0;
  • 58 436 979 ÷ 2 = 29 218 489 + 1;
  • 29 218 489 ÷ 2 = 14 609 244 + 1;
  • 14 609 244 ÷ 2 = 7 304 622 + 0;
  • 7 304 622 ÷ 2 = 3 652 311 + 0;
  • 3 652 311 ÷ 2 = 1 826 155 + 1;
  • 1 826 155 ÷ 2 = 913 077 + 1;
  • 913 077 ÷ 2 = 456 538 + 1;
  • 456 538 ÷ 2 = 228 269 + 0;
  • 228 269 ÷ 2 = 114 134 + 1;
  • 114 134 ÷ 2 = 57 067 + 0;
  • 57 067 ÷ 2 = 28 533 + 1;
  • 28 533 ÷ 2 = 14 266 + 1;
  • 14 266 ÷ 2 = 7 133 + 0;
  • 7 133 ÷ 2 = 3 566 + 1;
  • 3 566 ÷ 2 = 1 783 + 0;
  • 1 783 ÷ 2 = 891 + 1;
  • 891 ÷ 2 = 445 + 1;
  • 445 ÷ 2 = 222 + 1;
  • 222 ÷ 2 = 111 + 0;
  • 111 ÷ 2 = 55 + 1;
  • 55 ÷ 2 = 27 + 1;
  • 27 ÷ 2 = 13 + 1;
  • 13 ÷ 2 = 6 + 1;
  • 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.


1 869 983 342(10) = 110 1111 0111 0101 1010 1110 0110 1110(2)


3. Determine the signed binary number bit length:

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

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

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 869 983 342(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 869 983 342(10) = 0110 1111 0111 0101 1010 1110 0110 1110

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 869 983 341 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 869 983 343 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 -174 as a signed binary written in one's complement representation May 05 12:50 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 110,110,997 as a signed binary written in one's complement representation May 05 12:47 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 944,232,431 as a signed binary written in one's complement representation May 05 12:47 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -2,699 as a signed binary written in one's complement representation May 05 12:47 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -3,134,249,602 as a signed binary written in one's complement representation May 05 12:46 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 9,993 as a signed binary written in one's complement representation May 05 12:45 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 98,796 as a signed binary written in one's complement representation May 05 12:45 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 240,509 as a signed binary written in one's complement representation May 05 12:44 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,011,000,124 as a signed binary written in one's complement representation May 05 12:44 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 110,701,110,184 as a signed binary written in one's complement representation May 05 12:44 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