Convert -7 251 709 002 282 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number -7 251 709 002 282(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
-7 251 709 002 282 to a signed binary in one's (1's) complement representation?

  • A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.

1. Start with the positive version of the number:

|-7 251 709 002 282| = 7 251 709 002 282

2. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when you get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 7 251 709 002 282 ÷ 2 = 3 625 854 501 141 + 0;
  • 3 625 854 501 141 ÷ 2 = 1 812 927 250 570 + 1;
  • 1 812 927 250 570 ÷ 2 = 906 463 625 285 + 0;
  • 906 463 625 285 ÷ 2 = 453 231 812 642 + 1;
  • 453 231 812 642 ÷ 2 = 226 615 906 321 + 0;
  • 226 615 906 321 ÷ 2 = 113 307 953 160 + 1;
  • 113 307 953 160 ÷ 2 = 56 653 976 580 + 0;
  • 56 653 976 580 ÷ 2 = 28 326 988 290 + 0;
  • 28 326 988 290 ÷ 2 = 14 163 494 145 + 0;
  • 14 163 494 145 ÷ 2 = 7 081 747 072 + 1;
  • 7 081 747 072 ÷ 2 = 3 540 873 536 + 0;
  • 3 540 873 536 ÷ 2 = 1 770 436 768 + 0;
  • 1 770 436 768 ÷ 2 = 885 218 384 + 0;
  • 885 218 384 ÷ 2 = 442 609 192 + 0;
  • 442 609 192 ÷ 2 = 221 304 596 + 0;
  • 221 304 596 ÷ 2 = 110 652 298 + 0;
  • 110 652 298 ÷ 2 = 55 326 149 + 0;
  • 55 326 149 ÷ 2 = 27 663 074 + 1;
  • 27 663 074 ÷ 2 = 13 831 537 + 0;
  • 13 831 537 ÷ 2 = 6 915 768 + 1;
  • 6 915 768 ÷ 2 = 3 457 884 + 0;
  • 3 457 884 ÷ 2 = 1 728 942 + 0;
  • 1 728 942 ÷ 2 = 864 471 + 0;
  • 864 471 ÷ 2 = 432 235 + 1;
  • 432 235 ÷ 2 = 216 117 + 1;
  • 216 117 ÷ 2 = 108 058 + 1;
  • 108 058 ÷ 2 = 54 029 + 0;
  • 54 029 ÷ 2 = 27 014 + 1;
  • 27 014 ÷ 2 = 13 507 + 0;
  • 13 507 ÷ 2 = 6 753 + 1;
  • 6 753 ÷ 2 = 3 376 + 1;
  • 3 376 ÷ 2 = 1 688 + 0;
  • 1 688 ÷ 2 = 844 + 0;
  • 844 ÷ 2 = 422 + 0;
  • 422 ÷ 2 = 211 + 0;
  • 211 ÷ 2 = 105 + 1;
  • 105 ÷ 2 = 52 + 1;
  • 52 ÷ 2 = 26 + 0;
  • 26 ÷ 2 = 13 + 0;
  • 13 ÷ 2 = 6 + 1;
  • 6 ÷ 2 = 3 + 0;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

7 251 709 002 282(10) = 110 1001 1000 0110 1011 1000 1010 0000 0010 0010 1010(2)

4. Determine the signed binary number bit length:

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

  • 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, 43,

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

=== is: 64.


5. 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.


7 251 709 002 282(10) = 0000 0000 0000 0000 0000 0110 1001 1000 0110 1011 1000 1010 0000 0010 0010 1010

6. Get the negative integer number representation:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in one's complement representation,

  • ... Reverse all the bits from 0 to 1 and from 1 to 0 (flip the digits).


-7 251 709 002 282(10) = !(0000 0000 0000 0000 0000 0110 1001 1000 0110 1011 1000 1010 0000 0010 0010 1010)


Decimal Number -7 251 709 002 282(10) converted to signed binary in one's complement representation:

-7 251 709 002 282(10) = 1111 1111 1111 1111 1111 1001 0110 0111 1001 0100 0111 0101 1111 1101 1101 0101

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

Share

» More ops: Convert decimal -7 251 709 002 253 to signed binary in one's (1's) complement representation

» Calculations Performed by Our Visitors: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Data organized on a Monthly Basis

» Month 11, 2025 [November]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: November - by our visitors

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