Converter to signed binary: converting decimal system (base ten) signed integer numbers

Convert signed integer numbers from the decimal system (base ten) to signed binary

Latest signed integers numbers converted from decimal (base ten) to signed binary

245 = 0000 0000 1111 0101Feb 21 18:35 UTC (GMT)
100,000,000,000 = 0000 0000 0000 0000 0000 0000 0001 0111 0100 1000 0111 0110 1110 1000 0000 0000Feb 21 18:31 UTC (GMT)
1,001,101 = 0000 0000 0000 1111 0100 0110 1000 1101Feb 21 18:18 UTC (GMT)
1,001,101 = 0000 0000 0000 1111 0100 0110 1000 1101Feb 21 18:17 UTC (GMT)
52 = 0011 0100Feb 21 18:17 UTC (GMT)
52 = 0011 0100Feb 21 18:15 UTC (GMT)
2,015 = 0000 0111 1101 1111Feb 21 18:11 UTC (GMT)
-6 = 1110Feb 21 18:11 UTC (GMT)
-223 = 1000 0000 1101 1111Feb 21 18:05 UTC (GMT)
-39 = 1010 0111Feb 21 17:41 UTC (GMT)
73 = 0100 1001Feb 21 16:56 UTC (GMT)
3 = 0011Feb 21 16:04 UTC (GMT)
52 = 0011 0100Feb 21 16:03 UTC (GMT)

How to convert signed integers from decimal system to binary code

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

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

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

  • 1. Start with the positive version of the number: |-63| = 63
  • 2. Divide repeatedly 63 by 2, keeping track of each remainder:
  • iteration division quotient remainder
    1 63 : 2 = 31 1
    2 31 : 2 = 15 1
    3 15 : 2 = 7 1
    4 7 : 2 = 3 1
    5 3 : 2 = 1 1
    6 1 : 2 = 0 1
    Last quotient is ZERO => FULL STOP
  • 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. Length of base 2 representation is 6, so the positive binary computer representation of a signed binary will take 8 bits (the least power of 2 higher than 6)- add '0' in front of the base 2 number, up to the required length, this way the first bit (leftmost) will always be '0', as for a positive:
    63(10) = 0011 1111(2)
  • 5. To get the negative integer number representation simply change the first bit (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