Convert 10 000 000 000 000 000 358 to Unsigned Binary (Base 2)

See below how to convert 10 000 000 000 000 000 358(10), the unsigned base 10 decimal system number to base 2 binary equivalent

What are the required steps to convert base 10 decimal system
number 10 000 000 000 000 000 358 to base 2 unsigned binary equivalent?

  • A number written in base ten, or a decimal system number, is a number written using the digits 0 through 9. A number written in base two, or a binary system number, is a number written using only the digits 0 and 1.

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when you get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 10 000 000 000 000 000 358 ÷ 2 = 5 000 000 000 000 000 179 + 0;
  • 5 000 000 000 000 000 179 ÷ 2 = 2 500 000 000 000 000 089 + 1;
  • 2 500 000 000 000 000 089 ÷ 2 = 1 250 000 000 000 000 044 + 1;
  • 1 250 000 000 000 000 044 ÷ 2 = 625 000 000 000 000 022 + 0;
  • 625 000 000 000 000 022 ÷ 2 = 312 500 000 000 000 011 + 0;
  • 312 500 000 000 000 011 ÷ 2 = 156 250 000 000 000 005 + 1;
  • 156 250 000 000 000 005 ÷ 2 = 78 125 000 000 000 002 + 1;
  • 78 125 000 000 000 002 ÷ 2 = 39 062 500 000 000 001 + 0;
  • 39 062 500 000 000 001 ÷ 2 = 19 531 250 000 000 000 + 1;
  • 19 531 250 000 000 000 ÷ 2 = 9 765 625 000 000 000 + 0;
  • 9 765 625 000 000 000 ÷ 2 = 4 882 812 500 000 000 + 0;
  • 4 882 812 500 000 000 ÷ 2 = 2 441 406 250 000 000 + 0;
  • 2 441 406 250 000 000 ÷ 2 = 1 220 703 125 000 000 + 0;
  • 1 220 703 125 000 000 ÷ 2 = 610 351 562 500 000 + 0;
  • 610 351 562 500 000 ÷ 2 = 305 175 781 250 000 + 0;
  • 305 175 781 250 000 ÷ 2 = 152 587 890 625 000 + 0;
  • 152 587 890 625 000 ÷ 2 = 76 293 945 312 500 + 0;
  • 76 293 945 312 500 ÷ 2 = 38 146 972 656 250 + 0;
  • 38 146 972 656 250 ÷ 2 = 19 073 486 328 125 + 0;
  • 19 073 486 328 125 ÷ 2 = 9 536 743 164 062 + 1;
  • 9 536 743 164 062 ÷ 2 = 4 768 371 582 031 + 0;
  • 4 768 371 582 031 ÷ 2 = 2 384 185 791 015 + 1;
  • 2 384 185 791 015 ÷ 2 = 1 192 092 895 507 + 1;
  • 1 192 092 895 507 ÷ 2 = 596 046 447 753 + 1;
  • 596 046 447 753 ÷ 2 = 298 023 223 876 + 1;
  • 298 023 223 876 ÷ 2 = 149 011 611 938 + 0;
  • 149 011 611 938 ÷ 2 = 74 505 805 969 + 0;
  • 74 505 805 969 ÷ 2 = 37 252 902 984 + 1;
  • 37 252 902 984 ÷ 2 = 18 626 451 492 + 0;
  • 18 626 451 492 ÷ 2 = 9 313 225 746 + 0;
  • 9 313 225 746 ÷ 2 = 4 656 612 873 + 0;
  • 4 656 612 873 ÷ 2 = 2 328 306 436 + 1;
  • 2 328 306 436 ÷ 2 = 1 164 153 218 + 0;
  • 1 164 153 218 ÷ 2 = 582 076 609 + 0;
  • 582 076 609 ÷ 2 = 291 038 304 + 1;
  • 291 038 304 ÷ 2 = 145 519 152 + 0;
  • 145 519 152 ÷ 2 = 72 759 576 + 0;
  • 72 759 576 ÷ 2 = 36 379 788 + 0;
  • 36 379 788 ÷ 2 = 18 189 894 + 0;
  • 18 189 894 ÷ 2 = 9 094 947 + 0;
  • 9 094 947 ÷ 2 = 4 547 473 + 1;
  • 4 547 473 ÷ 2 = 2 273 736 + 1;
  • 2 273 736 ÷ 2 = 1 136 868 + 0;
  • 1 136 868 ÷ 2 = 568 434 + 0;
  • 568 434 ÷ 2 = 284 217 + 0;
  • 284 217 ÷ 2 = 142 108 + 1;
  • 142 108 ÷ 2 = 71 054 + 0;
  • 71 054 ÷ 2 = 35 527 + 0;
  • 35 527 ÷ 2 = 17 763 + 1;
  • 17 763 ÷ 2 = 8 881 + 1;
  • 8 881 ÷ 2 = 4 440 + 1;
  • 4 440 ÷ 2 = 2 220 + 0;
  • 2 220 ÷ 2 = 1 110 + 0;
  • 1 110 ÷ 2 = 555 + 0;
  • 555 ÷ 2 = 277 + 1;
  • 277 ÷ 2 = 138 + 1;
  • 138 ÷ 2 = 69 + 0;
  • 69 ÷ 2 = 34 + 1;
  • 34 ÷ 2 = 17 + 0;
  • 17 ÷ 2 = 8 + 1;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

2. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

10 000 000 000 000 000 358(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

10 000 000 000 000 000 358 (base 10) = 1000 1010 1100 0111 0010 0011 0000 0100 1000 1001 1110 1000 0000 0001 0110 0110 (base 2)

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


How to convert unsigned integer numbers (positive) from decimal system (base 10) to binary = simply convert from base 10 to base 2

Follow the steps below to convert a base ten unsigned integer number to base two:

  • 1. Divide repeatedly by 2 the positive integer number that has to be converted to binary, keeping track of each remainder, until we get a QUOTIENT that is equal to ZERO.
  • 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).

Example: convert the positive integer number 55 from decimal system (base ten) to binary code (base two):

  • 1. Divide repeatedly 55 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder;
    • 55 ÷ 2 = 27 + 1;
    • 27 ÷ 2 = 13 + 1;
    • 13 ÷ 2 = 6 + 1;
    • 6 ÷ 2 = 3 + 0;
    • 3 ÷ 2 = 1 + 1;
    • 1 ÷ 2 = 0 + 1;
  • 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above:
  • 55(10) = 11 0111(2)
  • Number 5510, positive integer (no sign), converted from decimal system (base 10) to unsigned binary (base 2) = 11 0111(2)