### 1. Divide the number repeatedly by 2:

#### Keep track of each remainder.

#### We stop when we get a quotient that is equal to zero.

- division = quotient +
**remainder**; - 22 600 ÷ 2 = 11 300 +
**0**; - 11 300 ÷ 2 = 5 650 +
**0**; - 5 650 ÷ 2 = 2 825 +
**0**; - 2 825 ÷ 2 = 1 412 +
**1**; - 1 412 ÷ 2 = 706 +
**0**; - 706 ÷ 2 = 353 +
**0**; - 353 ÷ 2 = 176 +
**1**; - 176 ÷ 2 = 88 +
**0**; - 88 ÷ 2 = 44 +
**0**; - 44 ÷ 2 = 22 +
**0**; - 22 ÷ 2 = 11 +
**0**; - 11 ÷ 2 = 5 +
**1**; - 5 ÷ 2 = 2 +
**1**; - 2 ÷ 2 = 1 +
**0**; - 1 ÷ 2 = 0 +
**1**;

### 2. Construct the base 2 representation of the positive number:

#### Take all the remainders starting from the bottom of the list constructed above.

#### 22 600_{(10)} = 101 1000 0100 1000_{(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; ...

#### The first bit (the leftmost) indicates the sign:

#### 0 = positive integer number, 1 = negative integer number

#### The least number that is:

#### 1) a power of 2

#### 2) and is larger than the actual length, 15,

#### 3) so that the first bit (leftmost) could be zero

(we deal with a positive number at this moment)

#### === is: 16.

### 4. Get the 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, 16.

## Number 22 600_{(10)}, a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:

## 22 600_{(10)} = 0101 1000 0100 1000

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