Convert 84 868 486 263 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 84 868 486 263(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
84 868 486 263 to a signed binary in two's (2'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.

We stop when we get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 84 868 486 263 ÷ 2 = 42 434 243 131 + 1;
  • 42 434 243 131 ÷ 2 = 21 217 121 565 + 1;
  • 21 217 121 565 ÷ 2 = 10 608 560 782 + 1;
  • 10 608 560 782 ÷ 2 = 5 304 280 391 + 0;
  • 5 304 280 391 ÷ 2 = 2 652 140 195 + 1;
  • 2 652 140 195 ÷ 2 = 1 326 070 097 + 1;
  • 1 326 070 097 ÷ 2 = 663 035 048 + 1;
  • 663 035 048 ÷ 2 = 331 517 524 + 0;
  • 331 517 524 ÷ 2 = 165 758 762 + 0;
  • 165 758 762 ÷ 2 = 82 879 381 + 0;
  • 82 879 381 ÷ 2 = 41 439 690 + 1;
  • 41 439 690 ÷ 2 = 20 719 845 + 0;
  • 20 719 845 ÷ 2 = 10 359 922 + 1;
  • 10 359 922 ÷ 2 = 5 179 961 + 0;
  • 5 179 961 ÷ 2 = 2 589 980 + 1;
  • 2 589 980 ÷ 2 = 1 294 990 + 0;
  • 1 294 990 ÷ 2 = 647 495 + 0;
  • 647 495 ÷ 2 = 323 747 + 1;
  • 323 747 ÷ 2 = 161 873 + 1;
  • 161 873 ÷ 2 = 80 936 + 1;
  • 80 936 ÷ 2 = 40 468 + 0;
  • 40 468 ÷ 2 = 20 234 + 0;
  • 20 234 ÷ 2 = 10 117 + 0;
  • 10 117 ÷ 2 = 5 058 + 1;
  • 5 058 ÷ 2 = 2 529 + 0;
  • 2 529 ÷ 2 = 1 264 + 1;
  • 1 264 ÷ 2 = 632 + 0;
  • 632 ÷ 2 = 316 + 0;
  • 316 ÷ 2 = 158 + 0;
  • 158 ÷ 2 = 79 + 0;
  • 79 ÷ 2 = 39 + 1;
  • 39 ÷ 2 = 19 + 1;
  • 19 ÷ 2 = 9 + 1;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 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.

84 868 486 263(10) = 1 0011 1100 0010 1000 1110 0101 0100 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.


Decimal Number 84 868 486 263(10) converted to signed binary in two's complement representation:

84 868 486 263(10) = 0000 0000 0000 0000 0000 0000 0001 0011 1100 0010 1000 1110 0101 0100 0111 0111

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

Share

» More ops: Convert decimal 84 868 486 299 to signed binary in two's (2's) complement representation

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

» Month 05, 2026 [May]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: May - by our visitors

» Improve your social skills: Your greatest rival, your most powerful ally. NotebookLM YouTube Video of 7.54 minutes

How to convert signed integers from decimal system to signed binary in two's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in two'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, keeping track of each remainder, until we get a quotient that is 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, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will 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 1s and all 1 bits with 0s (reversing the digits).
  • 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

  • 1. Start with the positive version of the number: |-60| = 60
  • 2. Divide repeatedly 60 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 60 ÷ 2 = 30 + 0
    • 30 ÷ 2 = 15 + 0
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 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:
    60(10) = 11 1100(2)
  • 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
    60(10) = 0011 1100(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
    !(0011 1100) = 1100 0011
  • 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
    -60(10) = 1100 0011 + 1 = 1100 0100
  • Number -60(10), signed integer, converted from decimal system (base 10) to signed binary two's complement representation = 1100 0100