### 1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:

2^{15}

1 2^{14}

1 2^{13}

0 2^{12}

0 2^{11}

0 2^{10}

1 2^{9}

0 2^{8}

0 2^{7}

1 2^{6}

0 2^{5}

1 2^{4}

1 2^{3}

0 2^{2}

1 2^{1}

1 2^{0}

0

### 2. Multiply each bit by its corresponding power of 2 and add all the terms up:

#### 1100 0100 1011 0110_{(2)} =

#### (1 × 2^{15} + 1 × 2^{14} + 0 × 2^{13} + 0 × 2^{12} + 0 × 2^{11} + 1 × 2^{10} + 0 × 2^{9} + 0 × 2^{8} + 1 × 2^{7} + 0 × 2^{6} + 1 × 2^{5} + 1 × 2^{4} + 0 × 2^{3} + 1 × 2^{2} + 1 × 2^{1} + 0 × 2^{0})_{(10)} =

#### (32 768 + 16 384 + 0 + 0 + 0 + 1 024 + 0 + 0 + 128 + 0 + 32 + 16 + 0 + 4 + 2 + 0)_{(10)} =

#### (32 768 + 16 384 + 1 024 + 128 + 32 + 16 + 4 + 2)_{(10)} =

#### 50 358_{(10)}