Convert 290 043 214 572 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 290 043 214 572(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
290 043 214 572 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;
  • 290 043 214 572 ÷ 2 = 145 021 607 286 + 0;
  • 145 021 607 286 ÷ 2 = 72 510 803 643 + 0;
  • 72 510 803 643 ÷ 2 = 36 255 401 821 + 1;
  • 36 255 401 821 ÷ 2 = 18 127 700 910 + 1;
  • 18 127 700 910 ÷ 2 = 9 063 850 455 + 0;
  • 9 063 850 455 ÷ 2 = 4 531 925 227 + 1;
  • 4 531 925 227 ÷ 2 = 2 265 962 613 + 1;
  • 2 265 962 613 ÷ 2 = 1 132 981 306 + 1;
  • 1 132 981 306 ÷ 2 = 566 490 653 + 0;
  • 566 490 653 ÷ 2 = 283 245 326 + 1;
  • 283 245 326 ÷ 2 = 141 622 663 + 0;
  • 141 622 663 ÷ 2 = 70 811 331 + 1;
  • 70 811 331 ÷ 2 = 35 405 665 + 1;
  • 35 405 665 ÷ 2 = 17 702 832 + 1;
  • 17 702 832 ÷ 2 = 8 851 416 + 0;
  • 8 851 416 ÷ 2 = 4 425 708 + 0;
  • 4 425 708 ÷ 2 = 2 212 854 + 0;
  • 2 212 854 ÷ 2 = 1 106 427 + 0;
  • 1 106 427 ÷ 2 = 553 213 + 1;
  • 553 213 ÷ 2 = 276 606 + 1;
  • 276 606 ÷ 2 = 138 303 + 0;
  • 138 303 ÷ 2 = 69 151 + 1;
  • 69 151 ÷ 2 = 34 575 + 1;
  • 34 575 ÷ 2 = 17 287 + 1;
  • 17 287 ÷ 2 = 8 643 + 1;
  • 8 643 ÷ 2 = 4 321 + 1;
  • 4 321 ÷ 2 = 2 160 + 1;
  • 2 160 ÷ 2 = 1 080 + 0;
  • 1 080 ÷ 2 = 540 + 0;
  • 540 ÷ 2 = 270 + 0;
  • 270 ÷ 2 = 135 + 0;
  • 135 ÷ 2 = 67 + 1;
  • 67 ÷ 2 = 33 + 1;
  • 33 ÷ 2 = 16 + 1;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 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.

290 043 214 572(10) = 100 0011 1000 0111 1110 1100 0011 1010 1110 1100(2)

3. Determine the signed binary number bit length:

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

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

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 290 043 214 572(10) converted to signed binary in two's complement representation:

290 043 214 572(10) = 0000 0000 0000 0000 0000 0000 0100 0011 1000 0111 1110 1100 0011 1010 1110 1100

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

Share

» More ops: Convert decimal 290 043 214 582 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 07, 2026 [July]: Decimal Numbers Converted to Signed Binary in Two's (2's) Complement Representation. Calculations performed during the month of: July - by our visitors

» Improve your social skills: Show, Don’t Tell, the Strategic Power of Action. Gemini Notebook YouTube Video of 9.21 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