1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
230
1 229
0 228
0 227
0 226
0 225
1 224
0 223
0 222
1 221
0 220
0 219
1 218
0 217
0 216
0 215
0 214
0 213
0 212
0 211
1 210
1 29
1 28
1 27
1 26
1 25
1 24
1 23
0 22
0 21
1 20
1
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
100 0010 0100 1000 0000 1111 1111 0011(2) =
(1 × 230 + 0 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 1 × 225 + 0 × 224 + 0 × 223 + 1 × 222 + 0 × 221 + 0 × 220 + 1 × 219 + 0 × 218 + 0 × 217 + 0 × 216 + 0 × 215 + 0 × 214 + 0 × 213 + 0 × 212 + 1 × 211 + 1 × 210 + 1 × 29 + 1 × 28 + 1 × 27 + 1 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20)(10) =
(1 073 741 824 + 0 + 0 + 0 + 0 + 33 554 432 + 0 + 0 + 4 194 304 + 0 + 0 + 524 288 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 0 + 0 + 2 + 1)(10) =
(1 073 741 824 + 33 554 432 + 4 194 304 + 524 288 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 2 + 1)(10) =
1 112 018 931(10)