### 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**; - 491 603 ÷ 2 = 245 801 +
**1**; - 245 801 ÷ 2 = 122 900 +
**1**; - 122 900 ÷ 2 = 61 450 +
**0**; - 61 450 ÷ 2 = 30 725 +
**0**; - 30 725 ÷ 2 = 15 362 +
**1**; - 15 362 ÷ 2 = 7 681 +
**0**; - 7 681 ÷ 2 = 3 840 +
**1**; - 3 840 ÷ 2 = 1 920 +
**0**; - 1 920 ÷ 2 = 960 +
**0**; - 960 ÷ 2 = 480 +
**0**; - 480 ÷ 2 = 240 +
**0**; - 240 ÷ 2 = 120 +
**0**; - 120 ÷ 2 = 60 +
**0**; - 60 ÷ 2 = 30 +
**0**; - 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.

#### 491 603_{(10)} = 111 1000 0000 0101 0011_{(2)}

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

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

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

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

## Number 491 603_{(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:

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