1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
215
1 214
1 213
1 212
1 211
0 210
1 29
1 28
0 27
0 26
1 25
0 24
1 23
0 22
0 21
0 20
0
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
1111 0110 0101 0000(2) =
(1 × 215 + 1 × 214 + 1 × 213 + 1 × 212 + 0 × 211 + 1 × 210 + 1 × 29 + 0 × 28 + 0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =
(32 768 + 16 384 + 8 192 + 4 096 + 0 + 1 024 + 512 + 0 + 0 + 64 + 0 + 16 + 0 + 0 + 0 + 0)(10) =
(32 768 + 16 384 + 8 192 + 4 096 + 1 024 + 512 + 64 + 16)(10) =
63 056(10)
Conclusion: