Convert 0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000 Signed Binary in Two's (2's) Complement Representation on 64 Bit to Decimal

How to convert 0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000(2), signed binary in two's (2's) complement representation, to decimal

What are the steps to convert the signed binary in two's (2's) complement representation to an integer in decimal system (in base ten)?

1. Is this a positive or a negative number?

0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000 is the binary representation of a positive 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 = 01; 1 - 0 = 1; 1 - 1 = 0.

  • Subtract 1 from the initial binary number.

  • * Not the case - the number is positive


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:

* Not the case - the number is positive


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

  • 263

    0

  • 262

    0

  • 261

    0

  • 260

    0

  • 259

    0

  • 258

    0

  • 257

    0

  • 256

    0

  • 255

    1

  • 254

    1

  • 253

    1

  • 252

    1

  • 251

    1

  • 250

    0

  • 249

    0

  • 248

    0

  • 247

    1

  • 246

    1

  • 245

    0

  • 244

    0

  • 243

    0

  • 242

    1

  • 241

    1

  • 240

    0

  • 239

    1

  • 238

    1

  • 237

    1

  • 236

    0

  • 235

    0

  • 234

    1

  • 233

    1

  • 232

    0

  • 231

    1

  • 230

    0

  • 229

    1

  • 228

    1

  • 227

    1

  • 226

    1

  • 225

    1

  • 224

    0

  • 223

    0

  • 222

    1

  • 221

    1

  • 220

    0

  • 219

    0

  • 218

    1

  • 217

    1

  • 216

    0

  • 215

    0

  • 214

    1

  • 213

    1

  • 212

    0

  • 211

    0

  • 210

    1

  • 29

    0

  • 28

    0

  • 27

    0

  • 26

    1

  • 25

    1

  • 24

    0

  • 23

    1

  • 22

    0

  • 21

    0

  • 20

    0

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

0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000(2) =

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

(0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 36 028 797 018 963 968 + 18 014 398 509 481 984 + 9 007 199 254 740 992 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 0 + 0 + 0 + 140 737 488 355 328 + 70 368 744 177 664 + 0 + 0 + 0 + 4 398 046 511 104 + 2 199 023 255 552 + 0 + 549 755 813 888 + 274 877 906 944 + 137 438 953 472 + 0 + 0 + 17 179 869 184 + 8 589 934 592 + 0 + 2 147 483 648 + 0 + 536 870 912 + 268 435 456 + 134 217 728 + 67 108 864 + 33 554 432 + 0 + 0 + 4 194 304 + 2 097 152 + 0 + 0 + 262 144 + 131 072 + 0 + 0 + 16 384 + 8 192 + 0 + 0 + 1 024 + 0 + 0 + 0 + 64 + 32 + 0 + 8 + 0 + 0 + 0)(10) =

(36 028 797 018 963 968 + 18 014 398 509 481 984 + 9 007 199 254 740 992 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 140 737 488 355 328 + 70 368 744 177 664 + 4 398 046 511 104 + 2 199 023 255 552 + 549 755 813 888 + 274 877 906 944 + 137 438 953 472 + 17 179 869 184 + 8 589 934 592 + 2 147 483 648 + 536 870 912 + 268 435 456 + 134 217 728 + 67 108 864 + 33 554 432 + 4 194 304 + 2 097 152 + 262 144 + 131 072 + 16 384 + 8 192 + 1 024 + 64 + 32 + 8)(10) =

70 024 488 563 401 832(10)

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

0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000(2) = 70 024 488 563 401 832(10)

The number 0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000(2), signed binary in two's (2's) complement representation, converted and written as an integer in decimal system (base ten):
0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 1000(2) = 70 024 488 563 401 832(10)

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

Share

» More ops: Convert 0000 0000 1111 1000 1100 0110 1110 0110 1011 1110 0110 0110 0110 0100 0110 0111, signed binary in two's (2's) complement representation on 64 bit, to decimal

» Calculations Performed by Our Visitors: Signed binary in two's (2's) complement representation converted to decimal numbers. Data organized on a Monthly Basis

» Month 09, 2026 [September]: Signed Binary in Two's (2's) Complement Representation Converted to Decimal. Calculations performed during the month of: September - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity. Gemini Notebook YouTube Video of 6.59 minutes

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.