1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
216
1 215
0 214
0 213
0 212
0 211
0 210
0 29
1 28
0 27
0 26
0 25
0 24
1 23
0 22
1 21
1 20
1
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
1 0000 0010 0001 0111(2) =
(1 × 216 + 0 × 215 + 0 × 214 + 0 × 213 + 0 × 212 + 0 × 211 + 0 × 210 + 1 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 1 × 22 + 1 × 21 + 1 × 20)(10) =
(65 536 + 0 + 0 + 0 + 0 + 0 + 0 + 512 + 0 + 0 + 0 + 0 + 16 + 0 + 4 + 2 + 1)(10) =
(65 536 + 512 + 16 + 4 + 2 + 1)(10) =
66 071(10)