### 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**; - 30 081 938 ÷ 2 = 15 040 969 +
**0**; - 15 040 969 ÷ 2 = 7 520 484 +
**1**; - 7 520 484 ÷ 2 = 3 760 242 +
**0**; - 3 760 242 ÷ 2 = 1 880 121 +
**0**; - 1 880 121 ÷ 2 = 940 060 +
**1**; - 940 060 ÷ 2 = 470 030 +
**0**; - 470 030 ÷ 2 = 235 015 +
**0**; - 235 015 ÷ 2 = 117 507 +
**1**; - 117 507 ÷ 2 = 58 753 +
**1**; - 58 753 ÷ 2 = 29 376 +
**1**; - 29 376 ÷ 2 = 14 688 +
**0**; - 14 688 ÷ 2 = 7 344 +
**0**; - 7 344 ÷ 2 = 3 672 +
**0**; - 3 672 ÷ 2 = 1 836 +
**0**; - 1 836 ÷ 2 = 918 +
**0**; - 918 ÷ 2 = 459 +
**0**; - 459 ÷ 2 = 229 +
**1**; - 229 ÷ 2 = 114 +
**1**; - 114 ÷ 2 = 57 +
**0**; - 57 ÷ 2 = 28 +
**1**; - 28 ÷ 2 = 14 +
**0**; - 14 ÷ 2 = 7 +
**0**; - 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.

#### 30 081 938_{(10)} = 1 1100 1011 0000 0011 1001 0010_{(2)}

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

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

#### 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) is reserved for 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, 25,

#### 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: