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
1 210
1 29
1 28
1 27
0 26
0 25
0 24
0 23
1 22
0 21
1 20
0
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
1111 1111 0000 1010(2) =
(1 × 215 + 1 × 214 + 1 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 1 × 29 + 1 × 28 + 0 × 27 + 0 × 26 + 0 × 25 + 0 × 24 + 1 × 23 + 0 × 22 + 1 × 21 + 0 × 20)(10) =
(32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 0 + 0 + 0 + 0 + 8 + 0 + 2 + 0)(10) =
(32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 8 + 2)(10) =
65 290(10)