Convert 1 0000 1011 1011 1111 1000 1000 0111 1111 1110 1001 1111 1111 1111 0111 Unsigned Base 2 Binary Number on 57 Bit - to Base 10 Decimal System

How to convert 1 0000 1011 1011 1111 1000 1000 0111 1111 1110 1001 1111 1111 1111 0111(2), the unsigned base 2 binary number written on 57 bit, to a base 10 decimal system equivalent

What are the required steps to convert the base 2 unsigned binary number
1 0000 1011 1011 1111 1000 1000 0111 1111 1110 1001 1111 1111 1111 0111(2) to a base 10 decimal system equivalent?

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

  • 256

    1
  • 255

    0
  • 254

    0
  • 253

    0
  • 252

    0
  • 251

    1
  • 250

    0
  • 249

    1
  • 248

    1
  • 247

    1
  • 246

    0
  • 245

    1
  • 244

    1
  • 243

    1
  • 242

    1
  • 241

    1
  • 240

    1
  • 239

    1
  • 238

    0
  • 237

    0
  • 236

    0
  • 235

    1
  • 234

    0
  • 233

    0
  • 232

    0
  • 231

    0
  • 230

    1
  • 229

    1
  • 228

    1
  • 227

    1
  • 226

    1
  • 225

    1
  • 224

    1
  • 223

    1
  • 222

    1
  • 221

    1
  • 220

    0
  • 219

    1
  • 218

    0
  • 217

    0
  • 216

    1
  • 215

    1
  • 214

    1
  • 213

    1
  • 212

    1
  • 211

    1
  • 210

    1
  • 29

    1
  • 28

    1
  • 27

    1
  • 26

    1
  • 25

    1
  • 24

    1
  • 23

    0
  • 22

    1
  • 21

    1
  • 20

    1

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

1 0000 1011 1011 1111 1000 1000 0111 1111 1110 1001 1111 1111 1111 0111(2) =


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


(72 057 594 037 927 936 + 0 + 0 + 0 + 0 + 2 251 799 813 685 248 + 0 + 562 949 953 421 312 + 281 474 976 710 656 + 140 737 488 355 328 + 0 + 35 184 372 088 832 + 17 592 186 044 416 + 8 796 093 022 208 + 4 398 046 511 104 + 2 199 023 255 552 + 1 099 511 627 776 + 549 755 813 888 + 0 + 0 + 0 + 34 359 738 368 + 0 + 0 + 0 + 0 + 1 073 741 824 + 536 870 912 + 268 435 456 + 134 217 728 + 67 108 864 + 33 554 432 + 16 777 216 + 8 388 608 + 4 194 304 + 2 097 152 + 0 + 524 288 + 0 + 0 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 0 + 4 + 2 + 1)(10) =


(72 057 594 037 927 936 + 2 251 799 813 685 248 + 562 949 953 421 312 + 281 474 976 710 656 + 140 737 488 355 328 + 35 184 372 088 832 + 17 592 186 044 416 + 8 796 093 022 208 + 4 398 046 511 104 + 2 199 023 255 552 + 1 099 511 627 776 + 549 755 813 888 + 34 359 738 368 + 1 073 741 824 + 536 870 912 + 268 435 456 + 134 217 728 + 67 108 864 + 33 554 432 + 16 777 216 + 8 388 608 + 4 194 304 + 2 097 152 + 524 288 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 4 + 2 + 1)(10) =


75 364 411 764 244 471(10)

1 0000 1011 1011 1111 1000 1000 0111 1111 1110 1001 1111 1111 1111 0111(2), Base 2 unsigned number converted and written as a base 10 decimal system equivalent:
1 0000 1011 1011 1111 1000 1000 0111 1111 1110 1001 1111 1111 1111 0111(2) = 75 364 411 764 244 471(10)

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


How to convert unsigned binary numbers from binary system to decimal? Simply convert from base two to base ten.

To understand how to convert a number from base two to base ten, the easiest way is to do it through an example - convert the number from base two, 101 0011(2), to base ten:

  • 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, increasing each corresponding power of 2 by exactly one unit each time we move to the left:
  • powers of 2: 6 5 4 3 2 1 0
    digits: 1 0 1 0 0 1 1
  • 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:

    101 0011(2) =


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


    (64 + 0 + 16 + 0 + 0 + 2 + 1)(10) =


    (64 + 16 + 2 + 1)(10) =


    83(10)

  • Binary unsigned number (base 2), 101 0011(2) = 83(10), unsigned positive integer in base 10