1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
231
1 230
1 229
0 228
1 227
0 226
1 225
0 224
0 223
1 222
0 221
1 220
1 219
1 218
0 217
0 216
1 215
1 214
1 213
1 212
0 211
1 210
0 29
0 28
0 27
0 26
1 25
1 24
1 23
1 22
1 21
0 20
0
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
1101 0100 1011 1001 1110 1000 0111 1100(2) =
(1 × 231 + 1 × 230 + 0 × 229 + 1 × 228 + 0 × 227 + 1 × 226 + 0 × 225 + 0 × 224 + 1 × 223 + 0 × 222 + 1 × 221 + 1 × 220 + 1 × 219 + 0 × 218 + 0 × 217 + 1 × 216 + 1 × 215 + 1 × 214 + 1 × 213 + 0 × 212 + 1 × 211 + 0 × 210 + 0 × 29 + 0 × 28 + 0 × 27 + 1 × 26 + 1 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 0 × 21 + 0 × 20)(10) =
(2 147 483 648 + 1 073 741 824 + 0 + 268 435 456 + 0 + 67 108 864 + 0 + 0 + 8 388 608 + 0 + 2 097 152 + 1 048 576 + 524 288 + 0 + 0 + 65 536 + 32 768 + 16 384 + 8 192 + 0 + 2 048 + 0 + 0 + 0 + 0 + 64 + 32 + 16 + 8 + 4 + 0 + 0)(10) =
(2 147 483 648 + 1 073 741 824 + 268 435 456 + 67 108 864 + 8 388 608 + 2 097 152 + 1 048 576 + 524 288 + 65 536 + 32 768 + 16 384 + 8 192 + 2 048 + 64 + 32 + 16 + 8 + 4)(10) =
3 568 953 468(10)