### 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**; - 1 001 101 ÷ 2 = 500 550 +
**1**; - 500 550 ÷ 2 = 250 275 +
**0**; - 250 275 ÷ 2 = 125 137 +
**1**; - 125 137 ÷ 2 = 62 568 +
**1**; - 62 568 ÷ 2 = 31 284 +
**0**; - 31 284 ÷ 2 = 15 642 +
**0**; - 15 642 ÷ 2 = 7 821 +
**0**; - 7 821 ÷ 2 = 3 910 +
**1**; - 3 910 ÷ 2 = 1 955 +
**0**; - 1 955 ÷ 2 = 977 +
**1**; - 977 ÷ 2 = 488 +
**1**; - 488 ÷ 2 = 244 +
**0**; - 244 ÷ 2 = 122 +
**0**; - 122 ÷ 2 = 61 +
**0**; - 61 ÷ 2 = 30 +
**1**; - 30 ÷ 2 = 15 +
**0**; - 15 ÷ 2 = 7 +
**1**; - 7 ÷ 2 = 3 +
**1**; - 3 ÷ 2 = 1 +
**1**; - 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.

#### 1 001 101_{(10)} = 1111 0100 0110 1000 1101_{(2)}

### 3. Determine the signed binary number bit length:

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

#### 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, 20,

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

(we deal with a positive number at this moment)

#### === is: 32.

### 4. Get the positive binary computer representation on 32 bits (4 Bytes):

#### If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32.