Convert 110 010 110 111 321 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 110 010 110 111 321(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
110 010 110 111 321 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;
  • 110 010 110 111 321 ÷ 2 = 55 005 055 055 660 + 1;
  • 55 005 055 055 660 ÷ 2 = 27 502 527 527 830 + 0;
  • 27 502 527 527 830 ÷ 2 = 13 751 263 763 915 + 0;
  • 13 751 263 763 915 ÷ 2 = 6 875 631 881 957 + 1;
  • 6 875 631 881 957 ÷ 2 = 3 437 815 940 978 + 1;
  • 3 437 815 940 978 ÷ 2 = 1 718 907 970 489 + 0;
  • 1 718 907 970 489 ÷ 2 = 859 453 985 244 + 1;
  • 859 453 985 244 ÷ 2 = 429 726 992 622 + 0;
  • 429 726 992 622 ÷ 2 = 214 863 496 311 + 0;
  • 214 863 496 311 ÷ 2 = 107 431 748 155 + 1;
  • 107 431 748 155 ÷ 2 = 53 715 874 077 + 1;
  • 53 715 874 077 ÷ 2 = 26 857 937 038 + 1;
  • 26 857 937 038 ÷ 2 = 13 428 968 519 + 0;
  • 13 428 968 519 ÷ 2 = 6 714 484 259 + 1;
  • 6 714 484 259 ÷ 2 = 3 357 242 129 + 1;
  • 3 357 242 129 ÷ 2 = 1 678 621 064 + 1;
  • 1 678 621 064 ÷ 2 = 839 310 532 + 0;
  • 839 310 532 ÷ 2 = 419 655 266 + 0;
  • 419 655 266 ÷ 2 = 209 827 633 + 0;
  • 209 827 633 ÷ 2 = 104 913 816 + 1;
  • 104 913 816 ÷ 2 = 52 456 908 + 0;
  • 52 456 908 ÷ 2 = 26 228 454 + 0;
  • 26 228 454 ÷ 2 = 13 114 227 + 0;
  • 13 114 227 ÷ 2 = 6 557 113 + 1;
  • 6 557 113 ÷ 2 = 3 278 556 + 1;
  • 3 278 556 ÷ 2 = 1 639 278 + 0;
  • 1 639 278 ÷ 2 = 819 639 + 0;
  • 819 639 ÷ 2 = 409 819 + 1;
  • 409 819 ÷ 2 = 204 909 + 1;
  • 204 909 ÷ 2 = 102 454 + 1;
  • 102 454 ÷ 2 = 51 227 + 0;
  • 51 227 ÷ 2 = 25 613 + 1;
  • 25 613 ÷ 2 = 12 806 + 1;
  • 12 806 ÷ 2 = 6 403 + 0;
  • 6 403 ÷ 2 = 3 201 + 1;
  • 3 201 ÷ 2 = 1 600 + 1;
  • 1 600 ÷ 2 = 800 + 0;
  • 800 ÷ 2 = 400 + 0;
  • 400 ÷ 2 = 200 + 0;
  • 200 ÷ 2 = 100 + 0;
  • 100 ÷ 2 = 50 + 0;
  • 50 ÷ 2 = 25 + 0;
  • 25 ÷ 2 = 12 + 1;
  • 12 ÷ 2 = 6 + 0;
  • 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.

110 010 110 111 321(10) = 110 0100 0000 1101 1011 1001 1000 1000 1110 1110 0101 1001(2)

3. Determine the signed binary number bit length:

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

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

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 110 010 110 111 321(10) converted to signed binary in two's complement representation:

110 010 110 111 321(10) = 0000 0000 0000 0000 0110 0100 0000 1101 1011 1001 1000 1000 1110 1110 0101 1001

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

Share

» More ops: Convert decimal 110 010 110 111 340 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 06, 2026 [June]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: June - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity and Concealed Intentions. NotebookLM YouTube Video of 6.59 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