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