One's Complement: Integer ↗ Binary: 4 026 531 829 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 4 026 531 829(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;
  • 4 026 531 829 ÷ 2 = 2 013 265 914 + 1;
  • 2 013 265 914 ÷ 2 = 1 006 632 957 + 0;
  • 1 006 632 957 ÷ 2 = 503 316 478 + 1;
  • 503 316 478 ÷ 2 = 251 658 239 + 0;
  • 251 658 239 ÷ 2 = 125 829 119 + 1;
  • 125 829 119 ÷ 2 = 62 914 559 + 1;
  • 62 914 559 ÷ 2 = 31 457 279 + 1;
  • 31 457 279 ÷ 2 = 15 728 639 + 1;
  • 15 728 639 ÷ 2 = 7 864 319 + 1;
  • 7 864 319 ÷ 2 = 3 932 159 + 1;
  • 3 932 159 ÷ 2 = 1 966 079 + 1;
  • 1 966 079 ÷ 2 = 983 039 + 1;
  • 983 039 ÷ 2 = 491 519 + 1;
  • 491 519 ÷ 2 = 245 759 + 1;
  • 245 759 ÷ 2 = 122 879 + 1;
  • 122 879 ÷ 2 = 61 439 + 1;
  • 61 439 ÷ 2 = 30 719 + 1;
  • 30 719 ÷ 2 = 15 359 + 1;
  • 15 359 ÷ 2 = 7 679 + 1;
  • 7 679 ÷ 2 = 3 839 + 1;
  • 3 839 ÷ 2 = 1 919 + 1;
  • 1 919 ÷ 2 = 959 + 1;
  • 959 ÷ 2 = 479 + 1;
  • 479 ÷ 2 = 239 + 1;
  • 239 ÷ 2 = 119 + 1;
  • 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.


4 026 531 829(10) = 1110 1111 1111 1111 1111 1111 1111 0101(2)


3. Determine the signed binary number bit length:

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

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

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 4 026 531 829(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:

4 026 531 829(10) = 0000 0000 0000 0000 0000 0000 0000 0000 1110 1111 1111 1111 1111 1111 1111 0101

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 4 026 531 828 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 4 026 531 830 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 100,099,999,893 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 10,111,085 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 111,101,010,990 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -39,730 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,100,219 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,011,100,986 as a signed binary written in one's complement representation May 18 18:36 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 5,138 as a signed binary written in one's complement representation May 18 18:36 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 747 as a signed binary written in one's complement representation May 18 18:35 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -130 as a signed binary written in one's complement representation May 18 18:35 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -70 as a signed binary written in one's complement representation May 18 18:34 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