2. Multiply each bit by its corresponding power of 2 and add all the terms up.
110 1111 0101 1101 0010 0110 1100 0000(2) =
(1 × 230 + 1 × 229 + 0 × 228 + 1 × 227 + 1 × 226 + 1 × 225 + 1 × 224 + 0 × 223 + 1 × 222 + 0 × 221 + 1 × 220 + 1 × 219 + 1 × 218 + 0 × 217 + 1 × 216 + 0 × 215 + 0 × 214 + 1 × 213 + 0 × 212 + 0 × 211 + 1 × 210 + 1 × 29 + 0 × 28 + 1 × 27 + 1 × 26 + 0 × 25 + 0 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =
(1 073 741 824 + 536 870 912 + 0 + 134 217 728 + 67 108 864 + 33 554 432 + 16 777 216 + 0 + 4 194 304 + 0 + 1 048 576 + 524 288 + 262 144 + 0 + 65 536 + 0 + 0 + 8 192 + 0 + 0 + 1 024 + 512 + 0 + 128 + 64 + 0 + 0 + 0 + 0 + 0 + 0)(10) =
(1 073 741 824 + 536 870 912 + 134 217 728 + 67 108 864 + 33 554 432 + 16 777 216 + 4 194 304 + 1 048 576 + 524 288 + 262 144 + 65 536 + 8 192 + 1 024 + 512 + 128 + 64)(10) =
1 868 375 744(10)
The number 110 1111 0101 1101 0010 0110 1100 0000(2) converted from an unsigned binary (in base 2) and written as a positive integer (with no sign) in decimal system (in base ten):
110 1111 0101 1101 0010 0110 1100 0000(2) = 1 868 375 744(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.