Two's Complement: Binary ↘ Integer: 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000 Signed Binary Number in Two's Complement Representation, Converted and Written as a Decimal System Integer (in Base Ten)

Signed binary in two's complement representation 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) converted to an integer in decimal system (in base ten) = ?

1. Is this a positive or a negative number?

1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000 is the binary representation of a negative integer, on 64 bits (8 Bytes).


In a signed binary in two's complement representation, the first bit (the leftmost) indicates the sign, 1 = negative, 0 = positive.


2. Get the binary representation in one's complement.

* Run this step only if the number is negative *

Note on binary subtraction rules:

11 - 1 = 10; 10 - 1 = 1; 1 - 0 = 1; 1 - 1 = 0.


Subtract 1 from the initial binary number.

1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000 - 1 = 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1010 1111


3. Get the binary representation of the positive (unsigned) number.

* Run this step only if the number is negative *

Flip all the bits of the signed binary in one's complement representation (reverse the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:

!(1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1010 1111) = 0010 0001 0101 1100 1011 0000 1111 0001 0010 0001 0010 0100 1110 1011 0101 0000


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

  • 263

    0
  • 262

    0
  • 261

    1
  • 260

    0
  • 259

    0
  • 258

    0
  • 257

    0
  • 256

    1
  • 255

    0
  • 254

    1
  • 253

    0
  • 252

    1
  • 251

    1
  • 250

    1
  • 249

    0
  • 248

    0
  • 247

    1
  • 246

    0
  • 245

    1
  • 244

    1
  • 243

    0
  • 242

    0
  • 241

    0
  • 240

    0
  • 239

    1
  • 238

    1
  • 237

    1
  • 236

    1
  • 235

    0
  • 234

    0
  • 233

    0
  • 232

    1
  • 231

    0
  • 230

    0
  • 229

    1
  • 228

    0
  • 227

    0
  • 226

    0
  • 225

    0
  • 224

    1
  • 223

    0
  • 222

    0
  • 221

    1
  • 220

    0
  • 219

    0
  • 218

    1
  • 217

    0
  • 216

    0
  • 215

    1
  • 214

    1
  • 213

    1
  • 212

    0
  • 211

    1
  • 210

    0
  • 29

    1
  • 28

    1
  • 27

    0
  • 26

    1
  • 25

    0
  • 24

    1
  • 23

    0
  • 22

    0
  • 21

    0
  • 20

    0

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

0010 0001 0101 1100 1011 0000 1111 0001 0010 0001 0010 0100 1110 1011 0101 0000(2) =


(0 × 263 + 0 × 262 + 1 × 261 + 0 × 260 + 0 × 259 + 0 × 258 + 0 × 257 + 1 × 256 + 0 × 255 + 1 × 254 + 0 × 253 + 1 × 252 + 1 × 251 + 1 × 250 + 0 × 249 + 0 × 248 + 1 × 247 + 0 × 246 + 1 × 245 + 1 × 244 + 0 × 243 + 0 × 242 + 0 × 241 + 0 × 240 + 1 × 239 + 1 × 238 + 1 × 237 + 1 × 236 + 0 × 235 + 0 × 234 + 0 × 233 + 1 × 232 + 0 × 231 + 0 × 230 + 1 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 0 × 225 + 1 × 224 + 0 × 223 + 0 × 222 + 1 × 221 + 0 × 220 + 0 × 219 + 1 × 218 + 0 × 217 + 0 × 216 + 1 × 215 + 1 × 214 + 1 × 213 + 0 × 212 + 1 × 211 + 0 × 210 + 1 × 29 + 1 × 28 + 0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =


(0 + 0 + 2 305 843 009 213 693 952 + 0 + 0 + 0 + 0 + 72 057 594 037 927 936 + 0 + 18 014 398 509 481 984 + 0 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 1 125 899 906 842 624 + 0 + 0 + 140 737 488 355 328 + 0 + 35 184 372 088 832 + 17 592 186 044 416 + 0 + 0 + 0 + 0 + 549 755 813 888 + 274 877 906 944 + 137 438 953 472 + 68 719 476 736 + 0 + 0 + 0 + 4 294 967 296 + 0 + 0 + 536 870 912 + 0 + 0 + 0 + 0 + 16 777 216 + 0 + 0 + 2 097 152 + 0 + 0 + 262 144 + 0 + 0 + 32 768 + 16 384 + 8 192 + 0 + 2 048 + 0 + 512 + 256 + 0 + 64 + 0 + 16 + 0 + 0 + 0 + 0)(10) =


(2 305 843 009 213 693 952 + 72 057 594 037 927 936 + 18 014 398 509 481 984 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 1 125 899 906 842 624 + 140 737 488 355 328 + 35 184 372 088 832 + 17 592 186 044 416 + 549 755 813 888 + 274 877 906 944 + 137 438 953 472 + 68 719 476 736 + 4 294 967 296 + 536 870 912 + 16 777 216 + 2 097 152 + 262 144 + 32 768 + 16 384 + 8 192 + 2 048 + 512 + 256 + 64 + 16)(10) =


2 403 990 850 798 676 816(10)

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

1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) = -2 403 990 850 798 676 816(10)

The signed binary number in two's complement representation 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) converted and written as an integer in decimal system (base ten):
1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) = -2 403 990 850 798 676 816(10)

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

The latest binary numbers written in two\'s complement representation converted to signed integers written in decimal system (in base ten)

Convert the signed binary number written in two's complement representation 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000, write it as a decimal system (base ten) integer Mar 29 11:15 UTC (GMT)
Convert the signed binary number written in two's complement representation 0000 0000 1001 0101 0000 0000 0111 1010, write it as a decimal system (base ten) integer Mar 29 11:15 UTC (GMT)
Convert the signed binary number written in two's complement representation 0000 0000 0000 0001 1000 1101 1000 1001, write it as a decimal system (base ten) integer Mar 29 11:15 UTC (GMT)
Convert the signed binary number written in two's complement representation 0111 0111 0011 0101 1001 0100 1000 1101, write it as a decimal system (base ten) integer Mar 29 11:13 UTC (GMT)
Convert the signed binary number written in two's complement representation 0000 0000 0000 0001 0001 0110 1110 1000, write it as a decimal system (base ten) integer Mar 29 11:13 UTC (GMT)
Convert the signed binary number written in two's complement representation 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1110 0000 0000 0110 0111, write it as a decimal system (base ten) integer Mar 29 11:12 UTC (GMT)
Convert the signed binary number written in two's complement representation 0000 0000 0000 0101 0010 0000 1000 1111, write it as a decimal system (base ten) integer Mar 29 11:12 UTC (GMT)
All the signed binary numbers written in two's complement representation converted to decimal system (base ten) integers

How to convert signed binary numbers in two's complement representation from binary system to decimal

To understand how to convert a signed binary number in two's complement representation from the binary system to decimal (base ten), the easiest way is to do it by an example - convert binary, 1101 1110, to base ten:

  • In a signed binary two's complement, first bit (leftmost) indicates the sign, 1 = negative, 0 = positive. The first bit is 1, so our number is negative.
  • Get the signed binary representation in one's complement, subtract 1 from the initial number:
    1101 1110 - 1 = 1101 1101
  • Get the binary representation of the positive number, flip all the bits in the signed binary one's complement representation (reversing the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:
    !(1101 1101) = 0010 0010
  • Write bellow the positive binary number representation 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, increasing each corresonding power of 2 by exactly one unit:
  • powers of 2: 7 6 5 4 3 2 1 0
    digits: 0 0 1 0 0 0 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:

    0010 0010(2) =


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


    (0 + 0 + 32 + 0 + 0 + 0 + 2 + 0)(10) =


    (32 + 2)(10) =


    34(10)

  • Signed binary number in two's complement representation, 1101 1110 = -34(10), a signed negative integer in base 10.