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

2^{14}

1 2^{13}

1 2^{12}

0 2^{11}

0 2^{10}

0 2^{9}

1 2^{8}

0 2^{7}

0 2^{6}

1 2^{5}

1 2^{4}

0 2^{3}

1 2^{2}

1 2^{1}

0 2^{0}

0

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

#### 110 0010 0110 1100_{(2)} =

#### (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} + 1 × 2^{5} + 0 × 2^{4} + 1 × 2^{3} + 1 × 2^{2} + 0 × 2^{1} + 0 × 2^{0})_{(10)} =

#### (16 384 + 8 192 + 0 + 0 + 0 + 512 + 0 + 0 + 64 + 32 + 0 + 8 + 4 + 0 + 0)_{(10)} =

#### (16 384 + 8 192 + 512 + 64 + 32 + 8 + 4)_{(10)} =

#### 25 196_{(10)}

## Conclusion: