Convert 1 100 001 011 000 060 to a Signed Binary (Base 2)

How to convert 1 100 001 011 000 060(10), a signed base 10 integer number? How to write it as a signed binary code in base 2

What are the required steps to convert base 10 integer
number 1 100 001 011 000 060 to signed binary code (in base 2)?

  • 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;
  • 1 100 001 011 000 060 ÷ 2 = 550 000 505 500 030 + 0;
  • 550 000 505 500 030 ÷ 2 = 275 000 252 750 015 + 0;
  • 275 000 252 750 015 ÷ 2 = 137 500 126 375 007 + 1;
  • 137 500 126 375 007 ÷ 2 = 68 750 063 187 503 + 1;
  • 68 750 063 187 503 ÷ 2 = 34 375 031 593 751 + 1;
  • 34 375 031 593 751 ÷ 2 = 17 187 515 796 875 + 1;
  • 17 187 515 796 875 ÷ 2 = 8 593 757 898 437 + 1;
  • 8 593 757 898 437 ÷ 2 = 4 296 878 949 218 + 1;
  • 4 296 878 949 218 ÷ 2 = 2 148 439 474 609 + 0;
  • 2 148 439 474 609 ÷ 2 = 1 074 219 737 304 + 1;
  • 1 074 219 737 304 ÷ 2 = 537 109 868 652 + 0;
  • 537 109 868 652 ÷ 2 = 268 554 934 326 + 0;
  • 268 554 934 326 ÷ 2 = 134 277 467 163 + 0;
  • 134 277 467 163 ÷ 2 = 67 138 733 581 + 1;
  • 67 138 733 581 ÷ 2 = 33 569 366 790 + 1;
  • 33 569 366 790 ÷ 2 = 16 784 683 395 + 0;
  • 16 784 683 395 ÷ 2 = 8 392 341 697 + 1;
  • 8 392 341 697 ÷ 2 = 4 196 170 848 + 1;
  • 4 196 170 848 ÷ 2 = 2 098 085 424 + 0;
  • 2 098 085 424 ÷ 2 = 1 049 042 712 + 0;
  • 1 049 042 712 ÷ 2 = 524 521 356 + 0;
  • 524 521 356 ÷ 2 = 262 260 678 + 0;
  • 262 260 678 ÷ 2 = 131 130 339 + 0;
  • 131 130 339 ÷ 2 = 65 565 169 + 1;
  • 65 565 169 ÷ 2 = 32 782 584 + 1;
  • 32 782 584 ÷ 2 = 16 391 292 + 0;
  • 16 391 292 ÷ 2 = 8 195 646 + 0;
  • 8 195 646 ÷ 2 = 4 097 823 + 0;
  • 4 097 823 ÷ 2 = 2 048 911 + 1;
  • 2 048 911 ÷ 2 = 1 024 455 + 1;
  • 1 024 455 ÷ 2 = 512 227 + 1;
  • 512 227 ÷ 2 = 256 113 + 1;
  • 256 113 ÷ 2 = 128 056 + 1;
  • 128 056 ÷ 2 = 64 028 + 0;
  • 64 028 ÷ 2 = 32 014 + 0;
  • 32 014 ÷ 2 = 16 007 + 0;
  • 16 007 ÷ 2 = 8 003 + 1;
  • 8 003 ÷ 2 = 4 001 + 1;
  • 4 001 ÷ 2 = 2 000 + 1;
  • 2 000 ÷ 2 = 1 000 + 0;
  • 1 000 ÷ 2 = 500 + 0;
  • 500 ÷ 2 = 250 + 0;
  • 250 ÷ 2 = 125 + 0;
  • 125 ÷ 2 = 62 + 1;
  • 62 ÷ 2 = 31 + 0;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 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.

1 100 001 011 000 060(10) = 11 1110 1000 0111 0001 1111 0001 1000 0011 0110 0010 1111 1100(2)


3. Determine the signed binary number bit length:

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

  • 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) is reserved for 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, 50,

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:


1 100 001 011 000 060(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 100 001 011 000 060(10) = 0000 0000 0000 0011 1110 1000 0111 0001 1111 0001 1000 0011 0110 0010 1111 1100

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

Share

» More ops: Convert 1 100 001 011 000 091, a signed base 10 integer number, write it as a signed binary code (in base 2) equivalent

» Calculations Performed by Our Visitors: Signed base 10 integer numbers converted and written as signed binary code (base 2) equivalents. Data organized on a Monthly Basis

» Month 04, 2026 [April]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: April - by our visitors

» Improve your social skills: Reputation: Bridge Between Company's Actions and Market Value. NotebookLM YouTube Video of 6.55 minutes

How to convert signed base 10 integers in decimal to binary code system

Follow the steps below to convert a signed base ten integer number to signed binary:

  • 1. In a signed binary, first bit (the leftmost) is reserved for sign: 0 = positive integer number, 1 = positive integer number. If the number to be converted is negative, start with its positive version.
  • 2. Divide repeatedly by 2 the positive integer number keeping track of each remainder. STOP when 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 have a length of 4, 8, 16, 32, 64, ... bits (power of 2) - if needed, fill in extra '0' bits in front of the base 2 number (to the left), up to the right length; this way the first bit (the leftmost one) is always '0', as for a positive representation.
  • 5. To get the negative reprezentation of the number, simply switch the first bit (the leftmost one), from '0' to '1'.

Example: convert the negative number -63 from decimal system (base ten) to signed binary code system:

  • 1. Start with the positive version of the number: |-63| = 63;
  • 2. Divide repeatedly 63 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder
    • 63 ÷ 2 = 31 + 1
    • 31 ÷ 2 = 15 + 1
    • 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:
    63(10) = 11 1111(2)
  • 4. The actual length of base 2 representation number is 6, so the positive binary computer representation length of the signed binary will take in this case 8 bits (the least power of 2 higher than 6) - add extra '0's in front (to the left), up to the required length; this way the first bit (the leftmost one) is to be '0', as for a positive number:
    63(10) = 0011 1111(2)
  • 5. To get the negative integer number representation simply change the first bit (the leftmost), from '0' to '1':
    -63(10) = 1011 1111
  • Number -63(10), signed integer, converted from decimal system (base 10) to signed binary = 1011 1111