Convert 897 798 198 988 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number 897 798 198 988(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
897 798 198 988 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. 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;
  • 897 798 198 988 ÷ 2 = 448 899 099 494 + 0;
  • 448 899 099 494 ÷ 2 = 224 449 549 747 + 0;
  • 224 449 549 747 ÷ 2 = 112 224 774 873 + 1;
  • 112 224 774 873 ÷ 2 = 56 112 387 436 + 1;
  • 56 112 387 436 ÷ 2 = 28 056 193 718 + 0;
  • 28 056 193 718 ÷ 2 = 14 028 096 859 + 0;
  • 14 028 096 859 ÷ 2 = 7 014 048 429 + 1;
  • 7 014 048 429 ÷ 2 = 3 507 024 214 + 1;
  • 3 507 024 214 ÷ 2 = 1 753 512 107 + 0;
  • 1 753 512 107 ÷ 2 = 876 756 053 + 1;
  • 876 756 053 ÷ 2 = 438 378 026 + 1;
  • 438 378 026 ÷ 2 = 219 189 013 + 0;
  • 219 189 013 ÷ 2 = 109 594 506 + 1;
  • 109 594 506 ÷ 2 = 54 797 253 + 0;
  • 54 797 253 ÷ 2 = 27 398 626 + 1;
  • 27 398 626 ÷ 2 = 13 699 313 + 0;
  • 13 699 313 ÷ 2 = 6 849 656 + 1;
  • 6 849 656 ÷ 2 = 3 424 828 + 0;
  • 3 424 828 ÷ 2 = 1 712 414 + 0;
  • 1 712 414 ÷ 2 = 856 207 + 0;
  • 856 207 ÷ 2 = 428 103 + 1;
  • 428 103 ÷ 2 = 214 051 + 1;
  • 214 051 ÷ 2 = 107 025 + 1;
  • 107 025 ÷ 2 = 53 512 + 1;
  • 53 512 ÷ 2 = 26 756 + 0;
  • 26 756 ÷ 2 = 13 378 + 0;
  • 13 378 ÷ 2 = 6 689 + 0;
  • 6 689 ÷ 2 = 3 344 + 1;
  • 3 344 ÷ 2 = 1 672 + 0;
  • 1 672 ÷ 2 = 836 + 0;
  • 836 ÷ 2 = 418 + 0;
  • 418 ÷ 2 = 209 + 0;
  • 209 ÷ 2 = 104 + 1;
  • 104 ÷ 2 = 52 + 0;
  • 52 ÷ 2 = 26 + 0;
  • 26 ÷ 2 = 13 + 0;
  • 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.

897 798 198 988(10) = 1101 0001 0000 1000 1111 0001 0101 0110 1100 1100(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.


Decimal Number 897 798 198 988(10) converted to signed binary in one's complement representation:

897 798 198 988(10) = 0000 0000 0000 0000 0000 0000 1101 0001 0000 1000 1111 0001 0101 0110 1100 1100

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

Share

» More ops: Convert decimal 897 798 199 011 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 09, 2026 [September]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: September - by our visitors

» Improve your social skills: Your Greatest Competitor, Your Most Powerful Ally. Gemini Notebook YouTube Video of 7.54 minutes

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