Base ten decimal system signed integer number -58 converted to signed binary in one's complement representation

How to convert a signed integer in decimal system (in base 10): -58(10) to a signed binary one's complement representation

2. Divide the number repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:

• division = quotient + remainder;
• 58 ÷ 2 = 29 + 0;
• 29 ÷ 2 = 14 + 1;
• 14 ÷ 2 = 7 + 0;
• 7 ÷ 2 = 3 + 1;
• 3 ÷ 2 = 1 + 1;
• 1 ÷ 2 = 0 + 1;

Latest signed integers numbers converted from decimal system to signed binary in one's complement representation

 -58 = 1100 0101 Jul 19 17:12 UTC (GMT) 10,101 = 0010 0111 0111 0101 Jul 19 17:12 UTC (GMT) 10,100,110 = 0000 0000 1001 1010 0001 1101 1000 1110 Jul 19 17:12 UTC (GMT) 1,010,011 = 0000 0000 0000 1111 0110 1001 0101 1011 Jul 19 17:12 UTC (GMT) 10,100,101 = 0000 0000 1001 1010 0001 1101 1000 0101 Jul 19 17:12 UTC (GMT) 101,001 = 0000 0000 0000 0001 1000 1010 1000 1001 Jul 19 17:12 UTC (GMT) 10,100,011 = 0000 0000 1001 1010 0001 1101 0010 1011 Jul 19 17:11 UTC (GMT) 101,000 = 0000 0000 0000 0001 1000 1010 1000 1000 Jul 19 17:11 UTC (GMT) 1,010 = 0000 0011 1111 0010 Jul 19 17:11 UTC (GMT) 10,011,110 = 0000 0000 1001 1000 1100 0001 1110 0110 Jul 19 17:11 UTC (GMT) 10,011,101 = 0000 0000 1001 1000 1100 0001 1101 1101 Jul 19 17:11 UTC (GMT) 100,111 = 0000 0000 0000 0001 1000 0111 0000 1111 Jul 19 17:11 UTC (GMT) 10,011,010 = 0000 0000 1001 1000 1100 0001 1000 0010 Jul 19 17:11 UTC (GMT) All decimal integer numbers converted to signed binary one's complement representation

How to convert signed integers from the decimal system to signed binary in one's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in one's complement representation:

• 1. If the number to be converted is negative, start with the positive version of the number.
• 2. Divide repeatedly by 2 the positive representation of the integer number that is to be converted to binary, keeping track of each remainder, until we get a quotient that is equal to 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 must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, fill in '0' bits in front (to the left) of the base 2 number calculated above, up to the right length; this way the first bit (leftmost) will always be '0', correctly representing a positive number.
• 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's.

Example: convert the negative number -49 from the decimal system (base ten) to signed binary one's complement:

• 1. Start with the positive version of the number: |-49| = 49
• 2. Divide repeatedly 49 by 2, keeping track of each remainder:
• division = quotient + remainder
• 49 ÷ 2 = 24 + 1
• 24 ÷ 2 = 12 + 0
• 12 ÷ 2 = 6 + 0
• 6 ÷ 2 = 3 + 0
• 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:
49(10) = 11 0001(2)
• 4. The actual bit length of base 2 representation is 6, so the positive binary computer representation of a signed binary will take in this case 8 bits (the least power of 2 that is larger than 6) - add '0's in front of the base 2 number, up to the required length:
49(10) = 0011 0001(2)
• 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's:
-49(10) = 1100 1110