# Signed binary number 0000 0000 0000 1001 0000 1100 0110 1010 converted to an integer in base ten

• 230

0
• 229

0
• 228

0
• 227

0
• 226

0
• 225

0
• 224

0
• 223

0
• 222

0
• 221

0
• 220

0
• 219

1
• 218

0
• 217

0
• 216

1
• 215

0
• 214

0
• 213

0
• 212

0
• 211

1
• 210

1
• 29

0
• 28

0
• 27

0
• 26

1
• 25

1
• 24

0
• 23

1
• 22

0
• 21

1
• 20

0

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

 0000 0000 0000 1001 0000 1100 0110 1010 = 593,002 Apr 18 09:03 UTC (GMT) 0000 0000 0000 0011 1111 0101 0010 1100 = 259,372 Apr 18 09:02 UTC (GMT) 1011 1101 = -61 Apr 18 09:02 UTC (GMT) 0000 0000 0010 1110 1111 1011 1011 1010 = 3,079,098 Apr 18 09:02 UTC (GMT) 1011 1101 0000 1101 = -15,629 Apr 18 09:01 UTC (GMT) 0000 0000 0000 0000 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1001 0111 = 281,474,976,710,551 Apr 18 09:01 UTC (GMT) 0111 1101 0011 1101 = 32,061 Apr 18 09:01 UTC (GMT) 0001 1110 1011 1001 = 7,865 Apr 18 09:00 UTC (GMT) 1110 1101 1011 1111 1111 1111 1110 0110 = -1,841,299,430 Apr 18 09:00 UTC (GMT) 0011 1110 0000 1111 = 15,887 Apr 18 09:00 UTC (GMT) 0000 1000 0011 0011 = 2,099 Apr 18 09:00 UTC (GMT) 1100 0001 1010 1000 = -16,808 Apr 18 09:00 UTC (GMT) 0101 1011 0100 0011 = 23,363 Apr 18 09:00 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: