- division = quotient +
**remainder**; - 179 ÷ 2 = 89 +
**1**; - 89 ÷ 2 = 44 +
**1**; - 44 ÷ 2 = 22 +
**0**; - 22 ÷ 2 = 11 +
**0**; - 11 ÷ 2 = 5 +
**1**; - 5 ÷ 2 = 2 +
**1**; - 2 ÷ 2 = 1 +
**0**; - 1 ÷ 2 = 0 +
**1**;

(we deal with a positive number at this moment)

- 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, keeping track of each remainder, until 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 must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will 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 1s and all 1 bits with 0s (reversing the digits).
- 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

- 1. Start with the positive version of the number: |-60| = 60
- 2. Divide repeatedly 60 by 2, keeping track of each remainder:
- division = quotient +
**remainder** - 60 ÷ 2 = 30 +
**0** - 30 ÷ 2 = 15 +
**0** - 15 ÷ 2 = 7 +
**1** - 7 ÷ 2 = 3 +
**1** - 3 ÷ 2 = 1 +
**1** - 1 ÷ 2 = 0 +
**1**

- division = quotient +
- 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:

60_{(10)}= 11 1100_{(2)} - 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:

60_{(10)}= 0011 1100_{(2)} - 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):

!(0011 1100) = 1100 0011 - 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:

-60_{(10)}= 1100 0011 + 1 = 1100 0100

### 1.1. Unsigned integer -> Unsigned binary

### 1.2. Signed integer -> Signed binary

### 1.3. Signed integer -> Signed binary one's complement

### 1.4. Signed integer -> Signed binary two's complement

### 2.1. Decimal -> 32bit single precision IEEE 754 binary floating point

### 2.2. Decimal -> 64bit double precision IEEE 754 binary floating point

### 3.1. Unsigned binary -> Unsigned integer

### 3.2. Signed binary -> Signed integer

### 3.3. Signed binary one's complement -> Signed integer

### 3.4. Signed binary two's complement -> Signed integer