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

2^{13}

1 2^{12}

1 2^{11}

1 2^{10}

0 2^{9}

1 2^{8}

1 2^{7}

0 2^{6}

1 2^{5}

0 2^{4}

1 2^{3}

0 2^{2}

0 2^{1}

0 2^{0}

0

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

#### 11 1011 0101 0000_{(2)} =

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

#### (8 192 + 4 096 + 2 048 + 0 + 512 + 256 + 0 + 64 + 0 + 16 + 0 + 0 + 0 + 0)_{(10)} =

#### (8 192 + 4 096 + 2 048 + 512 + 256 + 64 + 16)_{(10)} =

#### 15 184_{(10)}