Convert 1101 0101 0110 1010 1111 0100 1101 0101 0010 1000 1010 1010 1010 0010 1100 Unsigned Base 2 Binary Number on 60 Bit - to Base 10 Decimal System

How to convert 1101 0101 0110 1010 1111 0100 1101 0101 0010 1000 1010 1010 1010 0010 1100(2), the unsigned base 2 binary number written on 60 bit, to a base 10 decimal system equivalent

What are the required steps to convert the base 2 unsigned binary number
1101 0101 0110 1010 1111 0100 1101 0101 0010 1000 1010 1010 1010 0010 1100(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.

  • 259

    1
  • 258

    1
  • 257

    0
  • 256

    1
  • 255

    0
  • 254

    1
  • 253

    0
  • 252

    1
  • 251

    0
  • 250

    1
  • 249

    1
  • 248

    0
  • 247

    1
  • 246

    0
  • 245

    1
  • 244

    0
  • 243

    1
  • 242

    1
  • 241

    1
  • 240

    1
  • 239

    0
  • 238

    1
  • 237

    0
  • 236

    0
  • 235

    1
  • 234

    1
  • 233

    0
  • 232

    1
  • 231

    0
  • 230

    1
  • 229

    0
  • 228

    1
  • 227

    0
  • 226

    0
  • 225

    1
  • 224

    0
  • 223

    1
  • 222

    0
  • 221

    0
  • 220

    0
  • 219

    1
  • 218

    0
  • 217

    1
  • 216

    0
  • 215

    1
  • 214

    0
  • 213

    1
  • 212

    0
  • 211

    1
  • 210

    0
  • 29

    1
  • 28

    0
  • 27

    0
  • 26

    0
  • 25

    1
  • 24

    0
  • 23

    1
  • 22

    1
  • 21

    0
  • 20

    0

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

1101 0101 0110 1010 1111 0100 1101 0101 0010 1000 1010 1010 1010 0010 1100(2) =


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


(576 460 752 303 423 488 + 288 230 376 151 711 744 + 0 + 72 057 594 037 927 936 + 0 + 18 014 398 509 481 984 + 0 + 4 503 599 627 370 496 + 0 + 1 125 899 906 842 624 + 562 949 953 421 312 + 0 + 140 737 488 355 328 + 0 + 35 184 372 088 832 + 0 + 8 796 093 022 208 + 4 398 046 511 104 + 2 199 023 255 552 + 1 099 511 627 776 + 0 + 274 877 906 944 + 0 + 0 + 34 359 738 368 + 17 179 869 184 + 0 + 4 294 967 296 + 0 + 1 073 741 824 + 0 + 268 435 456 + 0 + 0 + 33 554 432 + 0 + 8 388 608 + 0 + 0 + 0 + 524 288 + 0 + 131 072 + 0 + 32 768 + 0 + 8 192 + 0 + 2 048 + 0 + 512 + 0 + 0 + 0 + 32 + 0 + 8 + 4 + 0 + 0)(10) =


(576 460 752 303 423 488 + 288 230 376 151 711 744 + 72 057 594 037 927 936 + 18 014 398 509 481 984 + 4 503 599 627 370 496 + 1 125 899 906 842 624 + 562 949 953 421 312 + 140 737 488 355 328 + 35 184 372 088 832 + 8 796 093 022 208 + 4 398 046 511 104 + 2 199 023 255 552 + 1 099 511 627 776 + 274 877 906 944 + 34 359 738 368 + 17 179 869 184 + 4 294 967 296 + 1 073 741 824 + 268 435 456 + 33 554 432 + 8 388 608 + 524 288 + 131 072 + 32 768 + 8 192 + 2 048 + 512 + 32 + 8 + 4)(10) =


961 148 317 122 341 420(10)

1101 0101 0110 1010 1111 0100 1101 0101 0010 1000 1010 1010 1010 0010 1100(2), Base 2 unsigned number converted and written as a base 10 decimal system equivalent:
1101 0101 0110 1010 1111 0100 1101 0101 0010 1000 1010 1010 1010 0010 1100(2) = 961 148 317 122 341 420(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