Convert 1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110 Base 2 Signed Binary Number on 64 Bit - To Base 10 Decimal System Integer

How to convert 1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110(2), the base 2 signed binary number on 64 bit, to a base 10 decimal system integer

What are the steps to convert the base 2 signed binary number
1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110(2) to a base 10 decimal system equivalent integer?

1. Is this a positive or a negative number?

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


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

1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110 = 010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110


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

  • 262

    0

  • 261

    1

  • 260

    0

  • 259

    0

  • 258

    0

  • 257

    0

  • 256

    0

  • 255

    1

  • 254

    1

  • 253

    1

  • 252

    1

  • 251

    0

  • 250

    0

  • 249

    0

  • 248

    0

  • 247

    1

  • 246

    0

  • 245

    0

  • 244

    0

  • 243

    1

  • 242

    0

  • 241

    1

  • 240

    1

  • 239

    0

  • 238

    0

  • 237

    0

  • 236

    1

  • 235

    0

  • 234

    0

  • 233

    0

  • 232

    1

  • 231

    1

  • 230

    1

  • 229

    1

  • 228

    0

  • 227

    1

  • 226

    1

  • 225

    1

  • 224

    0

  • 223

    0

  • 222

    0

  • 221

    1

  • 220

    1

  • 219

    0

  • 218

    0

  • 217

    1

  • 216

    1

  • 215

    0

  • 214

    1

  • 213

    0

  • 212

    1

  • 211

    1

  • 210

    1

  • 29

    1

  • 28

    1

  • 27

    0

  • 26

    0

  • 25

    1

  • 24

    1

  • 23

    1

  • 22

    1

  • 21

    1

  • 20

    0

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

010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110(2) =

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

(0 + 2 305 843 009 213 693 952 + 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 + 0 + 0 + 0 + 0 + 140 737 488 355 328 + 0 + 0 + 0 + 8 796 093 022 208 + 0 + 2 199 023 255 552 + 1 099 511 627 776 + 0 + 0 + 0 + 68 719 476 736 + 0 + 0 + 0 + 4 294 967 296 + 2 147 483 648 + 1 073 741 824 + 536 870 912 + 0 + 134 217 728 + 67 108 864 + 33 554 432 + 0 + 0 + 0 + 2 097 152 + 1 048 576 + 0 + 0 + 131 072 + 65 536 + 0 + 16 384 + 0 + 4 096 + 2 048 + 1 024 + 512 + 256 + 0 + 0 + 32 + 16 + 8 + 4 + 2 + 0)(10) =

(2 305 843 009 213 693 952 + 36 028 797 018 963 968 + 18 014 398 509 481 984 + 9 007 199 254 740 992 + 4 503 599 627 370 496 + 140 737 488 355 328 + 8 796 093 022 208 + 2 199 023 255 552 + 1 099 511 627 776 + 68 719 476 736 + 4 294 967 296 + 2 147 483 648 + 1 073 741 824 + 536 870 912 + 134 217 728 + 67 108 864 + 33 554 432 + 2 097 152 + 1 048 576 + 131 072 + 65 536 + 16 384 + 4 096 + 2 048 + 1 024 + 512 + 256 + 32 + 16 + 8 + 4 + 2)(10) =

2 373 549 912 751 300 414(10)

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

1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110(2) = -2 373 549 912 751 300 414(10)

1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110(2), Base 2 signed binary number, converted and written as a base 10 decimal system equivalent integer:
1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1110(2) = -2 373 549 912 751 300 414(10)

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

Share

» More ops: Convert 1010 0000 1111 0000 1000 1011 0001 0001 1110 1110 0011 0011 0101 1111 0011 1111, base 2 signed binary number on 64 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 06, 2026 [June]: Base 2 Signed Binary Numbers Converted and Written as Base 10 Decimal System Integer Number Equivalents. Calculations performed during the month of: June - by our visitors

» Improve your social skills: Your greatest rival, your most powerful ally. NotebookLM YouTube Video of 7.54 minutes

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