One's Complement: Binary ↘ Integer: 0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110 Signed Binary Number in One's Complement Representation, Converted and Written as a Decimal System Integer (in Base Ten)

Signed binary in one's complement representation 0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110(2) converted to an integer in decimal system (in base ten) = ?

1. Is this a positive or a negative number?

0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110 is the binary representation of a positive integer, on 64 bits (8 Bytes).


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


2. 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 *


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

  • 263

    0

  • 262

    1

  • 261

    0

  • 260

    0

  • 259

    1

  • 258

    1

  • 257

    0

  • 256

    1

  • 255

    1

  • 254

    0

  • 253

    1

  • 252

    1

  • 251

    1

  • 250

    0

  • 249

    0

  • 248

    0

  • 247

    0

  • 246

    1

  • 245

    1

  • 244

    0

  • 243

    1

  • 242

    0

  • 241

    1

  • 240

    0

  • 239

    0

  • 238

    0

  • 237

    1

  • 236

    1

  • 235

    1

  • 234

    0

  • 233

    0

  • 232

    1

  • 231

    1

  • 230

    1

  • 229

    0

  • 228

    0

  • 227

    0

  • 226

    1

  • 225

    1

  • 224

    0

  • 223

    0

  • 222

    1

  • 221

    0

  • 220

    1

  • 219

    0

  • 218

    0

  • 217

    1

  • 216

    0

  • 215

    1

  • 214

    1

  • 213

    0

  • 212

    0

  • 211

    0

  • 210

    1

  • 29

    1

  • 28

    1

  • 27

    1

  • 26

    1

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

0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110(2) =

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

(0 + 4 611 686 018 427 387 904 + 0 + 0 + 576 460 752 303 423 488 + 288 230 376 151 711 744 + 0 + 72 057 594 037 927 936 + 36 028 797 018 963 968 + 0 + 9 007 199 254 740 992 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 0 + 0 + 0 + 0 + 70 368 744 177 664 + 35 184 372 088 832 + 0 + 8 796 093 022 208 + 0 + 2 199 023 255 552 + 0 + 0 + 0 + 137 438 953 472 + 68 719 476 736 + 34 359 738 368 + 0 + 0 + 4 294 967 296 + 2 147 483 648 + 1 073 741 824 + 0 + 0 + 0 + 67 108 864 + 33 554 432 + 0 + 0 + 4 194 304 + 0 + 1 048 576 + 0 + 0 + 131 072 + 0 + 32 768 + 16 384 + 0 + 0 + 0 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 0)(10) =

(4 611 686 018 427 387 904 + 576 460 752 303 423 488 + 288 230 376 151 711 744 + 72 057 594 037 927 936 + 36 028 797 018 963 968 + 9 007 199 254 740 992 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 70 368 744 177 664 + 35 184 372 088 832 + 8 796 093 022 208 + 2 199 023 255 552 + 137 438 953 472 + 68 719 476 736 + 34 359 738 368 + 4 294 967 296 + 2 147 483 648 + 1 073 741 824 + 67 108 864 + 33 554 432 + 4 194 304 + 1 048 576 + 131 072 + 32 768 + 16 384 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2)(10) =

5 600 342 933 008 205 822(10)

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

0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110(2) = 5 600 342 933 008 205 822(10)

The signed binary number in one's complement representation 0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110(2) converted and written as an integer in decimal system (base ten):
0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1110(2) = 5 600 342 933 008 205 822(10)

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

More operations on signed binary in one's complement representation:

» The signed binary in one's complement representation 0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1101 converted and written as an integer number in decimal system (in base ten) = ?

» The signed binary in one's complement representation 0100 1101 1011 1000 0110 1010 0011 1001 1100 0110 0101 0010 1100 0111 1111 1111 converted and written as an integer number in decimal system (in base ten) = ?

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

Convert signed binary number written in one's complement representation 0010 0110 1110 0001, write it as a decimal system (base ten) integer Apr 26 20:29 UTC (GMT)
Convert signed binary number written in one's complement representation 1110 1111 1111 1111 1111 1111 1011 0000, write it as a decimal system (base ten) integer Apr 26 20:29 UTC (GMT)
Convert signed binary number written in one's complement representation 0000 0000 0000 0000 1000 1111 0001 0010, write it as a decimal system (base ten) integer Apr 26 20:29 UTC (GMT)
Convert signed binary number written in one's complement representation 0010 1010 1010 1011 1011 1010 1110 0101, write it as a decimal system (base ten) integer Apr 26 20:28 UTC (GMT)
Convert signed binary number written in one's complement representation 1110 0000 0110 1101, write it as a decimal system (base ten) integer Apr 26 20:28 UTC (GMT)
Convert signed binary number written in one's complement representation 0101 1101 1010 1110, write it as a decimal system (base ten) integer Apr 26 20:28 UTC (GMT)
Convert signed binary number written in one's complement representation 0000 0000 0000 1111 1101 1111 1001 1001, write it as a decimal system (base ten) integer Apr 26 20:27 UTC (GMT)
Convert signed binary number written in one's complement representation 1010 1100 0000 1111 1111 1111 1111 1110, write it as a decimal system (base ten) integer Apr 26 20:27 UTC (GMT)
Convert signed binary number written in one's complement representation 1101 0000, write it as a decimal system (base ten) integer Apr 26 20:27 UTC (GMT)
Convert signed binary number written in one's complement representation 0000 0001 0001 0100 0011 1010 0101 1101, write it as a decimal system (base ten) integer Apr 26 20:26 UTC (GMT)
All the signed binary numbers in one's complement representation converted to decimal system (base ten) integers

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

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

  • In a signed binary one's complement, first bit (leftmost) indicates the sign, 1 = negative, 0 = positive. The first bit is 1, so our number is negative.
  • 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:
    !(1001 1101) = 0110 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 by increasing each corresonding power of 2 by exactly one unit:
  • powers of 2: 7 6 5 4 3 2 1 0
    digits: 0 1 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:

    0110 0010(2) =

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

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

    (64 + 32 + 2)(10) =

    98(10)

  • Signed binary number in one's complement representation, 1001 1110 = -98(10), a signed negative integer in base 10