Convert 101 012 361 712 970 103 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number 101 012 361 712 970 103(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
101 012 361 712 970 103 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;
  • 101 012 361 712 970 103 ÷ 2 = 50 506 180 856 485 051 + 1;
  • 50 506 180 856 485 051 ÷ 2 = 25 253 090 428 242 525 + 1;
  • 25 253 090 428 242 525 ÷ 2 = 12 626 545 214 121 262 + 1;
  • 12 626 545 214 121 262 ÷ 2 = 6 313 272 607 060 631 + 0;
  • 6 313 272 607 060 631 ÷ 2 = 3 156 636 303 530 315 + 1;
  • 3 156 636 303 530 315 ÷ 2 = 1 578 318 151 765 157 + 1;
  • 1 578 318 151 765 157 ÷ 2 = 789 159 075 882 578 + 1;
  • 789 159 075 882 578 ÷ 2 = 394 579 537 941 289 + 0;
  • 394 579 537 941 289 ÷ 2 = 197 289 768 970 644 + 1;
  • 197 289 768 970 644 ÷ 2 = 98 644 884 485 322 + 0;
  • 98 644 884 485 322 ÷ 2 = 49 322 442 242 661 + 0;
  • 49 322 442 242 661 ÷ 2 = 24 661 221 121 330 + 1;
  • 24 661 221 121 330 ÷ 2 = 12 330 610 560 665 + 0;
  • 12 330 610 560 665 ÷ 2 = 6 165 305 280 332 + 1;
  • 6 165 305 280 332 ÷ 2 = 3 082 652 640 166 + 0;
  • 3 082 652 640 166 ÷ 2 = 1 541 326 320 083 + 0;
  • 1 541 326 320 083 ÷ 2 = 770 663 160 041 + 1;
  • 770 663 160 041 ÷ 2 = 385 331 580 020 + 1;
  • 385 331 580 020 ÷ 2 = 192 665 790 010 + 0;
  • 192 665 790 010 ÷ 2 = 96 332 895 005 + 0;
  • 96 332 895 005 ÷ 2 = 48 166 447 502 + 1;
  • 48 166 447 502 ÷ 2 = 24 083 223 751 + 0;
  • 24 083 223 751 ÷ 2 = 12 041 611 875 + 1;
  • 12 041 611 875 ÷ 2 = 6 020 805 937 + 1;
  • 6 020 805 937 ÷ 2 = 3 010 402 968 + 1;
  • 3 010 402 968 ÷ 2 = 1 505 201 484 + 0;
  • 1 505 201 484 ÷ 2 = 752 600 742 + 0;
  • 752 600 742 ÷ 2 = 376 300 371 + 0;
  • 376 300 371 ÷ 2 = 188 150 185 + 1;
  • 188 150 185 ÷ 2 = 94 075 092 + 1;
  • 94 075 092 ÷ 2 = 47 037 546 + 0;
  • 47 037 546 ÷ 2 = 23 518 773 + 0;
  • 23 518 773 ÷ 2 = 11 759 386 + 1;
  • 11 759 386 ÷ 2 = 5 879 693 + 0;
  • 5 879 693 ÷ 2 = 2 939 846 + 1;
  • 2 939 846 ÷ 2 = 1 469 923 + 0;
  • 1 469 923 ÷ 2 = 734 961 + 1;
  • 734 961 ÷ 2 = 367 480 + 1;
  • 367 480 ÷ 2 = 183 740 + 0;
  • 183 740 ÷ 2 = 91 870 + 0;
  • 91 870 ÷ 2 = 45 935 + 0;
  • 45 935 ÷ 2 = 22 967 + 1;
  • 22 967 ÷ 2 = 11 483 + 1;
  • 11 483 ÷ 2 = 5 741 + 1;
  • 5 741 ÷ 2 = 2 870 + 1;
  • 2 870 ÷ 2 = 1 435 + 0;
  • 1 435 ÷ 2 = 717 + 1;
  • 717 ÷ 2 = 358 + 1;
  • 358 ÷ 2 = 179 + 0;
  • 179 ÷ 2 = 89 + 1;
  • 89 ÷ 2 = 44 + 1;
  • 44 ÷ 2 = 22 + 0;
  • 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 012 361 712 970 103(10) = 1 0110 0110 1101 1110 0011 0101 0011 0001 1101 0011 0010 1001 0111 0111(2)

3. Determine the signed binary number bit length:

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

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

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 012 361 712 970 103(10) converted to signed binary in one's complement representation:

101 012 361 712 970 103(10) = 0000 0001 0110 0110 1101 1110 0011 0101 0011 0001 1101 0011 0010 1001 0111 0111

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

Share

» More ops: Convert decimal 101 012 361 712 970 148 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