Convert 1111 Base 2 Signed Binary Number on 4 Bit - To Base 10 Decimal System Integer

How to convert 1111(2), the base 2 signed binary number on 4 bit, to a base 10 decimal system integer

What are the steps to convert the base 2 signed binary number
1111(2) to a base 10 decimal system equivalent integer?

1. Is this a positive or a negative number?

1111 is the binary representation of a negative integer, on 4 bits.


  • 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:

1111 = 111


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

  • 22

    1

  • 21

    1

  • 20

    1

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

111(2) =

(1 × 22 + 1 × 21 + 1 × 20)(10) =

(4 + 2 + 1)(10) =

7(10)

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

1111(2) = -7(10)

1111(2), Base 2 signed binary number, converted and written as a base 10 decimal system equivalent integer:
1111(2) = -7(10)

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

Share

» More ops: Convert 1 0000, base 2 signed binary number on 5 bit, to base 10 decimal system integer equivalent

» Calculations performed by our visitors: Base 2 signed binary numbers converted and written as base 10 decimal system integer number equivalents. Data organized on a Monthly Basis

» Month 01, 2026 [January]: Base 2 Signed Binary Numbers Converted and Written as Base 10 Decimal System Integer Number Equivalents. Calculations performed during the month of: January - by our visitors

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