1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
231
1 230
0 229
0 228
0 227
0 226
0 225
0 224
0 223
0 222
0 221
0 220
0 219
0 218
0 217
0 216
0 215
0 214
0 213
0 212
1 211
1 210
1 29
1 28
0 27
0 26
1 25
1 24
0 23
0 22
0 21
0 20
1
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
1000 0000 0000 0000 0001 1110 0110 0001(2) =
(1 × 231 + 0 × 230 + 0 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 0 × 225 + 0 × 224 + 0 × 223 + 0 × 222 + 0 × 221 + 0 × 220 + 0 × 219 + 0 × 218 + 0 × 217 + 0 × 216 + 0 × 215 + 0 × 214 + 0 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 1 × 29 + 0 × 28 + 0 × 27 + 1 × 26 + 1 × 25 + 0 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 1 × 20)(10) =
(2 147 483 648 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 4 096 + 2 048 + 1 024 + 512 + 0 + 0 + 64 + 32 + 0 + 0 + 0 + 0 + 1)(10) =
(2 147 483 648 + 4 096 + 2 048 + 1 024 + 512 + 64 + 32 + 1)(10) =
2 147 491 425(10)