Signed binary number 0110 1000 converted to an integer in base ten

Signed binary 0110 1000(2) to an integer in decimal system (in base 10) = ?

1. Is this a positive or a negative number?


In a signed binary, first bit (the leftmost) is reserved for the sign, 1 = negative, 0 = positive. This bit does not count when calculating the absolute value.

0110 1000 is the binary representation of a positive integer, on 8 bits.


2. Construct the unsigned binary number, exclude the first bit (the leftmost), that is reserved for the sign:

0110 1000 = 110 1000

3. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:

    • 26

      1

    • 25

      1

    • 24

      0

    • 23

      1

    • 22

      0

    • 21

      0

    • 20

      0

4. Multiply each bit by its corresponding power of 2 and add all the terms up:

110 1000(2) =

(1 × 26 + 1 × 25 + 0 × 24 + 1 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =

(64 + 32 + 0 + 8 + 0 + 0 + 0)(10) =

(64 + 32 + 8)(10) =

104(10)

5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:

0110 1000(2) = 104(10)

Number 0110 1000(2) converted from signed binary to an integer in decimal system (in base 10):
0110 1000(2) = 104(10)

Spaces used to group digits: for binary, by 4.

More operations of this kind:

0110 0111 = ?

0110 1001 = ?


Convert signed binary numbers to integers in decimal system (base 10)

First bit (the leftmost) is reserved for the sign, 1 = negative, 0 = positive. This bit does not count when calculating the absolute value.

Entered binary number length must be: 2, 4, 8, 16, 32, or 64 - otherwise extra bits on 0 will be added in front (to the left).

How to convert a signed binary number to an integer in base ten:

1) Construct the unsigned binary number: exclude the first bit (the leftmost); this bit is reserved for the sign, 1 = negative, 0 = positive and does not count when calculating the absolute value (without sign).

2) Multiply each bit of the binary number by its corresponding power of 2 that its place value represents.

3) Add all the terms up to get the positive integer number in base ten.

4) Adjust the sign of the integer number by the first bit of the initial binary number.

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

0110 1000 = 104 Mar 01 23:11 UTC (GMT)
1110 1101 1100 0000 0000 0000 0000 0000 = -1,841,299,456 Mar 01 23:11 UTC (GMT)
0000 1101 0100 0111 = 3,399 Mar 01 23:11 UTC (GMT)
0000 0000 0000 0001 1111 1111 0110 0100 = 130,916 Mar 01 23:11 UTC (GMT)
0000 0000 0000 0000 0000 0000 0000 0001 1111 1111 1111 1111 1111 1111 1111 0011 = 8,589,934,579 Mar 01 23:11 UTC (GMT)
1010 1010 1111 1111 1111 1111 1111 1111 = -721,420,287 Mar 01 23:11 UTC (GMT)
0011 1101 = 61 Mar 01 23:10 UTC (GMT)
0000 0000 0000 0000 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1000 1001 = 281,474,976,710,537 Mar 01 23:10 UTC (GMT)
1101 0100 0000 0001 = -21,505 Mar 01 23:10 UTC (GMT)
0101 0101 1000 0111 = 21,895 Mar 01 23:10 UTC (GMT)
0000 1100 = 12 Mar 01 23:10 UTC (GMT)
0000 0111 0010 0011 = 1,827 Mar 01 23:10 UTC (GMT)
0010 1110 1111 0011 = 12,019 Mar 01 23:10 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:

    1001 1110 =

    - (0 × 26 + 0 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 1 × 21 + 0 × 20)(10) =

    - (0 + 0 + 16 + 8 + 4 + 2 + 0)(10) =

    - (16 + 8 + 4 + 2)(10) =

    -30(10)

  • Binary signed number, 1001 1110 = -30(10), signed negative integer in base 10