# Signed binary number 1010 1011 1100 1101 1110 1111 0001 0010 converted to an integer in base ten

• 230

0
• 229

1
• 228

0
• 227

1
• 226

0
• 225

1
• 224

1
• 223

1
• 222

1
• 221

0
• 220

0
• 219

1
• 218

1
• 217

0
• 216

1
• 215

1
• 214

1
• 213

1
• 212

0
• 211

1
• 210

1
• 29

1
• 28

1
• 27

0
• 26

0
• 25

0
• 24

1
• 23

0
• 22

0
• 21

1
• 20

0

## Latest signed binary numbers converted to signed integers in decimal system (base ten)

 1010 1011 1100 1101 1110 1111 0001 0010 = -734,916,370 Sep 23 00:28 UTC (GMT) 0000 0001 0001 0010 = 274 Sep 23 00:27 UTC (GMT) 1111 0001 1110 1000 = -29,160 Sep 23 00:27 UTC (GMT) 0000 0001 0001 0010 = 274 Sep 23 00:27 UTC (GMT) 1111 1111 1110 0001 = -32,737 Sep 23 00:27 UTC (GMT) 1101 = -5 Sep 23 00:27 UTC (GMT) 1111 1001 = -121 Sep 23 00:25 UTC (GMT) 1111 1000 = -120 Sep 23 00:25 UTC (GMT) 0000 0000 0000 1100 1110 0110 1101 0110 1001 0111 0000 0110 1100 0110 0001 0110 = 3,631,509,051,721,238 Sep 23 00:24 UTC (GMT) 0000 0000 0000 0001 1110 1100 0011 1100 = 126,012 Sep 23 00:23 UTC (GMT) 0000 0000 0000 1001 0000 1111 1101 1011 = 593,883 Sep 23 00:23 UTC (GMT) 0101 0101 1010 0010 = 21,922 Sep 23 00:23 UTC (GMT) 1010 0001 0101 1010 = -8,538 Sep 23 00:23 UTC (GMT) All the converted signed binary numbers to integers in base ten

## How to convert signed binary numbers from binary system to decimal (base ten)

### To understand how to convert a signed binary number from binary system to decimal (base ten), the easiest way is to do it through an example - convert the binary number, 1001 1110, to base ten:

• In a signed binary, the first bit (leftmost) is reserved for the sign, 1 = negative, 0 = positive. This bit does not count when calculating the absolute value (value without sign). The first bit is 1, so our number is negative.
• Write bellow the binary number in base two, and above each bit that makes up the binary number write the corresponding power of 2 (numeral base) that its place value represents, starting with zero, from the right of the number (rightmost bit), walking to the left of the number and increasing each corresonding power of 2 by exactly one unit, but ignoring the very first bit (the leftmost, the one representing the sign):
•  powers of 2: 6 5 4 3 2 1 0 digits: 1 0 0 1 1 1 1 0
• Build the representation of the positive number in base 10, by taking each digit of the binary number, multiplying it by the corresponding power of 2 and then adding all the terms up, but also taking care of the number sign: