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