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

40 = 0010 1000Jan 18 09:44 UTC (GMT)
-125 = 1111 1101Jan 18 09:43 UTC (GMT)
125,648 = 0000 0000 0000 0001 1110 1010 1101 0000Jan 18 09:42 UTC (GMT)
-65 = 1100 0001Jan 18 09:40 UTC (GMT)
-9,223,371,976,725,202,943 = 1111 1111 1111 1111 1111 1111 1111 0001 1111 1111 1111 1111 1000 0111 1111 1111Jan 18 09:39 UTC (GMT)
10 = 0000 1010Jan 18 09:39 UTC (GMT)
0 = 00Jan 18 09:38 UTC (GMT)
-12 = 1000 1100Jan 18 09:29 UTC (GMT)
63 = 0011 1111Jan 18 09:29 UTC (GMT)
-64 = 1100 0000Jan 18 09:29 UTC (GMT)
19 = 0001 0011Jan 18 09:28 UTC (GMT)
240 = 0000 0000 1111 0000Jan 18 09:28 UTC (GMT)
12 = 0000 1100Jan 18 09:28 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