# Signed binary number 0100 1011 0011 1111 converted to an integer in base ten

• 214

1
• 213

0
• 212

0
• 211

1
• 210

0
• 29

1
• 28

1
• 27

0
• 26

0
• 25

1
• 24

1
• 23

1
• 22

1
• 21

1
• 20

1

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

 1010 0100 0110 1000 = -9,320 Jan 24 13:43 UTC (GMT) 0100 1011 0011 1111 = 19,263 Jan 24 13:43 UTC (GMT) 0000 0000 0000 1011 0000 1011 0000 1011 0000 1011 0000 1011 0000 1011 0000 1011 = 3,108,366,801,636,107 Jan 24 13:43 UTC (GMT) 0110 0000 0110 1111 1111 1111 1111 1100 = 1,617,952,764 Jan 24 13:43 UTC (GMT) 0010 0100 0111 1101 = 9,341 Jan 24 13:43 UTC (GMT) 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 0000 1000 = -9,223,372,036,854,775,560 Jan 24 13:43 UTC (GMT) 1000 0001 0111 0111 = -375 Jan 24 13:43 UTC (GMT) 1100 0000 1010 1000 0000 1010 0000 0110 = -1,084,754,438 Jan 24 13:43 UTC (GMT) 1000 0010 1101 1011 = -731 Jan 24 13:42 UTC (GMT) 1001 0001 1011 0100 = -4,532 Jan 24 13:41 UTC (GMT) 0000 1000 = 8 Jan 24 13:41 UTC (GMT) 0010 1001 0000 1101 = 10,509 Jan 24 13:40 UTC (GMT) 0100 0001 1100 0101 0000 0000 0000 0000 = 1,103,429,632 Jan 24 13:39 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: