Convert 20 000 to a signed binary in one's complement representation, from a base 10 decimal system signed integer number

How to convert a signed integer in decimal system (in base 10): 20 000_{(10)} to a signed binary one's complement representation

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

division = quotient + remainder;

20 000 ÷ 2 = 10 000 + 0;

10 000 ÷ 2 = 5 000 + 0;

5 000 ÷ 2 = 2 500 + 0;

2 500 ÷ 2 = 1 250 + 0;

1 250 ÷ 2 = 625 + 0;

625 ÷ 2 = 312 + 1;

312 ÷ 2 = 156 + 0;

156 ÷ 2 = 78 + 0;

78 ÷ 2 = 39 + 0;

39 ÷ 2 = 19 + 1;

19 ÷ 2 = 9 + 1;

9 ÷ 2 = 4 + 1;

4 ÷ 2 = 2 + 0;

2 ÷ 2 = 1 + 0;

1 ÷ 2 = 0 + 1;

2. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:

20 000_{(10)} = 100 1110 0010 0000_{(2)}

3. Determine the signed binary number bit length:

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

A signed binary's bit length must be equal to a power of 2, as of: 2^{1} = 2; 2^{2} = 4; 2^{3} = 8; 2^{4} = 16; 2^{5} = 32; 2^{6} = 64; ...

First bit (the leftmost) indicates the sign, 1 = negative, 0 = positive.

The least number that is a power of 2 and is larger than the actual length so that the first bit (leftmost) could be zero is: 16.

4. Positive binary computer representation on 16 bits (2 Bytes) - if needed, add extra 0s in front (to the left) of the base 2 number, up to the required length:

20 000_{(10)} = 0100 1110 0010 0000

Conclusion: Number 20 000, a signed integer, converted from decimal system (base 10) to a signed binary one's complement representation: 20 000_{(10)} = 0100 1110 0010 0000

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

Convert signed integer numbers from the decimal system (base ten) to signed binary one's complement representation

How to convert a base 10 signed integer number to signed binary in one's complement representation:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is 0.

2) Construct the base 2 representation by taking the previously calculated remainders starting from the last remainder up to the first one, in that order.

3) Construct the positive binary computer representation so that the first bit is 0.

4) Only if the initial number is negative, switch all the bits from 0 to 1 and from 1 to 0 (reversing the digits).

Latest signed integer numbers converted from decimal system to signed binary in 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

Number -49_{(10)}, signed integer, converted from the decimal system (base 10) to signed binary in one's complement representation = 1100 1110