What are the steps to convert the base 2 signed binary number
0000 0000 1110 0010 0000 0000 0000 0100(2) to a base 10 decimal system equivalent integer?
1. Is this a positive or a negative number?
0000 0000 1110 0010 0000 0000 0000 0100 is the binary representation of a positive integer, on 32 bits (4 Bytes).
- In a signed binary, the first bit (the leftmost) is reserved for the sign, 1 = negative, 0 = positive. This bit does not count when calculating the absolute value.
2. Construct the unsigned binary number.
Exclude the first bit (the leftmost), that is reserved for the sign:
0000 0000 1110 0010 0000 0000 0000 0100 = 000 0000 1110 0010 0000 0000 0000 0100
3. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
230
0 229
0 228
0 227
0 226
0 225
0 224
0 223
1 222
1 221
1 220
0 219
0 218
0 217
1 216
0 215
0 214
0 213
0 212
0 211
0 210
0 29
0 28
0 27
0 26
0 25
0 24
0 23
0 22
1 21
0 20
0
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
000 0000 1110 0010 0000 0000 0000 0100(2) =
(0 × 230 + 0 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 0 × 225 + 0 × 224 + 1 × 223 + 1 × 222 + 1 × 221 + 0 × 220 + 0 × 219 + 0 × 218 + 1 × 217 + 0 × 216 + 0 × 215 + 0 × 214 + 0 × 213 + 0 × 212 + 0 × 211 + 0 × 210 + 0 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 0 × 25 + 0 × 24 + 0 × 23 + 1 × 22 + 0 × 21 + 0 × 20)(10) =
(0 + 0 + 0 + 0 + 0 + 0 + 0 + 8 388 608 + 4 194 304 + 2 097 152 + 0 + 0 + 0 + 131 072 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 4 + 0 + 0)(10) =
(8 388 608 + 4 194 304 + 2 097 152 + 131 072 + 4)(10) =
14 811 140(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
0000 0000 1110 0010 0000 0000 0000 0100(2) = 14 811 140(10)
0000 0000 1110 0010 0000 0000 0000 0100(2), Base 2 signed binary number, converted and written as a base 10 decimal system equivalent integer:
0000 0000 1110 0010 0000 0000 0000 0100(2) = 14 811 140(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.