2. Multiply each bit by its corresponding power of 2 and add all the terms up.
1100 0000 1111 1111 1101 0110 0101(2) =
(1 × 227 + 1 × 226 + 0 × 225 + 0 × 224 + 0 × 223 + 0 × 222 + 0 × 221 + 0 × 220 + 1 × 219 + 1 × 218 + 1 × 217 + 1 × 216 + 1 × 215 + 1 × 214 + 1 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 0 × 29 + 1 × 28 + 0 × 27 + 1 × 26 + 1 × 25 + 0 × 24 + 0 × 23 + 1 × 22 + 0 × 21 + 1 × 20)(10) =
(134 217 728 + 67 108 864 + 0 + 0 + 0 + 0 + 0 + 0 + 524 288 + 262 144 + 131 072 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 0 + 256 + 0 + 64 + 32 + 0 + 0 + 4 + 0 + 1)(10) =
(134 217 728 + 67 108 864 + 524 288 + 262 144 + 131 072 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 256 + 64 + 32 + 4 + 1)(10) =
202 374 501(10)
The number 1100 0000 1111 1111 1101 0110 0101(2) converted from an unsigned binary (in base 2) and written as a positive integer (with no sign) in decimal system (in base ten):
1100 0000 1111 1111 1101 0110 0101(2) = 202 374 501(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.