Signed: Integer ↗ Binary: 110 010 100 975 Convert the Integer Number to a Signed Binary. Converting and Writing the Base Ten Decimal System Signed Integer as Binary Code (Written in Base Two)

Signed integer number 110 010 100 975(10)
converted and written as a signed binary (base 2) = ?

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;
  • 110 010 100 975 ÷ 2 = 55 005 050 487 + 1;
  • 55 005 050 487 ÷ 2 = 27 502 525 243 + 1;
  • 27 502 525 243 ÷ 2 = 13 751 262 621 + 1;
  • 13 751 262 621 ÷ 2 = 6 875 631 310 + 1;
  • 6 875 631 310 ÷ 2 = 3 437 815 655 + 0;
  • 3 437 815 655 ÷ 2 = 1 718 907 827 + 1;
  • 1 718 907 827 ÷ 2 = 859 453 913 + 1;
  • 859 453 913 ÷ 2 = 429 726 956 + 1;
  • 429 726 956 ÷ 2 = 214 863 478 + 0;
  • 214 863 478 ÷ 2 = 107 431 739 + 0;
  • 107 431 739 ÷ 2 = 53 715 869 + 1;
  • 53 715 869 ÷ 2 = 26 857 934 + 1;
  • 26 857 934 ÷ 2 = 13 428 967 + 0;
  • 13 428 967 ÷ 2 = 6 714 483 + 1;
  • 6 714 483 ÷ 2 = 3 357 241 + 1;
  • 3 357 241 ÷ 2 = 1 678 620 + 1;
  • 1 678 620 ÷ 2 = 839 310 + 0;
  • 839 310 ÷ 2 = 419 655 + 0;
  • 419 655 ÷ 2 = 209 827 + 1;
  • 209 827 ÷ 2 = 104 913 + 1;
  • 104 913 ÷ 2 = 52 456 + 1;
  • 52 456 ÷ 2 = 26 228 + 0;
  • 26 228 ÷ 2 = 13 114 + 0;
  • 13 114 ÷ 2 = 6 557 + 0;
  • 6 557 ÷ 2 = 3 278 + 1;
  • 3 278 ÷ 2 = 1 639 + 0;
  • 1 639 ÷ 2 = 819 + 1;
  • 819 ÷ 2 = 409 + 1;
  • 409 ÷ 2 = 204 + 1;
  • 204 ÷ 2 = 102 + 0;
  • 102 ÷ 2 = 51 + 0;
  • 51 ÷ 2 = 25 + 1;
  • 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 010 100 975(10) = 1 1001 1001 1101 0001 1100 1110 1100 1110 1111(2)


3. Determine the signed binary number bit length:

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

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, 37,

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:


Number 110 010 100 975(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

110 010 100 975(10) = 0000 0000 0000 0000 0000 0000 0001 1001 1001 1101 0001 1100 1110 1100 1110 1111

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

More operations on signed integer numbers:

» Signed integer number 110 010 100 974 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

» Signed integer number 110 010 100 976 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

The latest signed integer numbers (that are written in decimal system, in base ten) converted and written as signed binary numbers

Convert the base ten decimal system integer number 1,165,846, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number -3,501, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number -499, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number -33,802, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number 41,753, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number -32,941, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number -32,786, write it as a signed binary written in base two May 20 06:28 UTC (GMT)
Convert the base ten decimal system integer number -327,705, write it as a signed binary written in base two May 20 06:27 UTC (GMT)
Convert the base ten decimal system integer number -327,369, write it as a signed binary written in base two May 20 06:27 UTC (GMT)
Convert the base ten decimal system integer number 11,100,011,000, write it as a signed binary written in base two May 20 06:27 UTC (GMT)
All the decimal system integer numbers (written in base ten) converted and written as signed binary numbers

How to convert signed integers from decimal system 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