Convert 110 011 101 101 284 to a Signed Binary (Base 2)

How to convert 110 011 101 101 284(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 110 011 101 101 284 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;
  • 110 011 101 101 284 ÷ 2 = 55 005 550 550 642 + 0;
  • 55 005 550 550 642 ÷ 2 = 27 502 775 275 321 + 0;
  • 27 502 775 275 321 ÷ 2 = 13 751 387 637 660 + 1;
  • 13 751 387 637 660 ÷ 2 = 6 875 693 818 830 + 0;
  • 6 875 693 818 830 ÷ 2 = 3 437 846 909 415 + 0;
  • 3 437 846 909 415 ÷ 2 = 1 718 923 454 707 + 1;
  • 1 718 923 454 707 ÷ 2 = 859 461 727 353 + 1;
  • 859 461 727 353 ÷ 2 = 429 730 863 676 + 1;
  • 429 730 863 676 ÷ 2 = 214 865 431 838 + 0;
  • 214 865 431 838 ÷ 2 = 107 432 715 919 + 0;
  • 107 432 715 919 ÷ 2 = 53 716 357 959 + 1;
  • 53 716 357 959 ÷ 2 = 26 858 178 979 + 1;
  • 26 858 178 979 ÷ 2 = 13 429 089 489 + 1;
  • 13 429 089 489 ÷ 2 = 6 714 544 744 + 1;
  • 6 714 544 744 ÷ 2 = 3 357 272 372 + 0;
  • 3 357 272 372 ÷ 2 = 1 678 636 186 + 0;
  • 1 678 636 186 ÷ 2 = 839 318 093 + 0;
  • 839 318 093 ÷ 2 = 419 659 046 + 1;
  • 419 659 046 ÷ 2 = 209 829 523 + 0;
  • 209 829 523 ÷ 2 = 104 914 761 + 1;
  • 104 914 761 ÷ 2 = 52 457 380 + 1;
  • 52 457 380 ÷ 2 = 26 228 690 + 0;
  • 26 228 690 ÷ 2 = 13 114 345 + 0;
  • 13 114 345 ÷ 2 = 6 557 172 + 1;
  • 6 557 172 ÷ 2 = 3 278 586 + 0;
  • 3 278 586 ÷ 2 = 1 639 293 + 0;
  • 1 639 293 ÷ 2 = 819 646 + 1;
  • 819 646 ÷ 2 = 409 823 + 0;
  • 409 823 ÷ 2 = 204 911 + 1;
  • 204 911 ÷ 2 = 102 455 + 1;
  • 102 455 ÷ 2 = 51 227 + 1;
  • 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 011 101 101 284(10) = 110 0100 0000 1101 1111 0100 1001 1010 0011 1100 1110 0100(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) 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, 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:


110 011 101 101 284(10) Base 10 integer number converted and written as a signed binary code (in base 2):

110 011 101 101 284(10) = 0000 0000 0000 0000 0110 0100 0000 1101 1111 0100 1001 1010 0011 1100 1110 0100

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

Share

» More ops: Convert 110 011 101 101 334, 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 08, 2026 [August]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: August - 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 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