Convert 101 000 011 000 353 to a Signed Binary in Two's (2's) Complement Representation

How to convert decimal number 101 000 011 000 353(10) to a signed binary in two's (2's) complement representation

What are the steps to convert decimal number
101 000 011 000 353 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;
  • 101 000 011 000 353 ÷ 2 = 50 500 005 500 176 + 1;
  • 50 500 005 500 176 ÷ 2 = 25 250 002 750 088 + 0;
  • 25 250 002 750 088 ÷ 2 = 12 625 001 375 044 + 0;
  • 12 625 001 375 044 ÷ 2 = 6 312 500 687 522 + 0;
  • 6 312 500 687 522 ÷ 2 = 3 156 250 343 761 + 0;
  • 3 156 250 343 761 ÷ 2 = 1 578 125 171 880 + 1;
  • 1 578 125 171 880 ÷ 2 = 789 062 585 940 + 0;
  • 789 062 585 940 ÷ 2 = 394 531 292 970 + 0;
  • 394 531 292 970 ÷ 2 = 197 265 646 485 + 0;
  • 197 265 646 485 ÷ 2 = 98 632 823 242 + 1;
  • 98 632 823 242 ÷ 2 = 49 316 411 621 + 0;
  • 49 316 411 621 ÷ 2 = 24 658 205 810 + 1;
  • 24 658 205 810 ÷ 2 = 12 329 102 905 + 0;
  • 12 329 102 905 ÷ 2 = 6 164 551 452 + 1;
  • 6 164 551 452 ÷ 2 = 3 082 275 726 + 0;
  • 3 082 275 726 ÷ 2 = 1 541 137 863 + 0;
  • 1 541 137 863 ÷ 2 = 770 568 931 + 1;
  • 770 568 931 ÷ 2 = 385 284 465 + 1;
  • 385 284 465 ÷ 2 = 192 642 232 + 1;
  • 192 642 232 ÷ 2 = 96 321 116 + 0;
  • 96 321 116 ÷ 2 = 48 160 558 + 0;
  • 48 160 558 ÷ 2 = 24 080 279 + 0;
  • 24 080 279 ÷ 2 = 12 040 139 + 1;
  • 12 040 139 ÷ 2 = 6 020 069 + 1;
  • 6 020 069 ÷ 2 = 3 010 034 + 1;
  • 3 010 034 ÷ 2 = 1 505 017 + 0;
  • 1 505 017 ÷ 2 = 752 508 + 1;
  • 752 508 ÷ 2 = 376 254 + 0;
  • 376 254 ÷ 2 = 188 127 + 0;
  • 188 127 ÷ 2 = 94 063 + 1;
  • 94 063 ÷ 2 = 47 031 + 1;
  • 47 031 ÷ 2 = 23 515 + 1;
  • 23 515 ÷ 2 = 11 757 + 1;
  • 11 757 ÷ 2 = 5 878 + 1;
  • 5 878 ÷ 2 = 2 939 + 0;
  • 2 939 ÷ 2 = 1 469 + 1;
  • 1 469 ÷ 2 = 734 + 1;
  • 734 ÷ 2 = 367 + 0;
  • 367 ÷ 2 = 183 + 1;
  • 183 ÷ 2 = 91 + 1;
  • 91 ÷ 2 = 45 + 1;
  • 45 ÷ 2 = 22 + 1;
  • 22 ÷ 2 = 11 + 0;
  • 11 ÷ 2 = 5 + 1;
  • 5 ÷ 2 = 2 + 1;
  • 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.

101 000 011 000 353(10) = 101 1011 1101 1011 1110 0101 1100 0111 0010 1010 0010 0001(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 101 000 011 000 353(10) converted to signed binary in two's complement representation:

101 000 011 000 353(10) = 0000 0000 0000 0000 0101 1011 1101 1011 1110 0101 1100 0111 0010 1010 0010 0001

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

Share

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

» Improve your social skills: Are You Using Communication by Design, or by Default? Gemini Notebook YouTube Video of 6.33 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