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

See below how to convert 10 000 000 000 000 022(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 022 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 022 ÷ 2 = 5 000 000 000 000 011 + 0;
  • 5 000 000 000 000 011 ÷ 2 = 2 500 000 000 000 005 + 1;
  • 2 500 000 000 000 005 ÷ 2 = 1 250 000 000 000 002 + 1;
  • 1 250 000 000 000 002 ÷ 2 = 625 000 000 000 001 + 0;
  • 625 000 000 000 001 ÷ 2 = 312 500 000 000 000 + 1;
  • 312 500 000 000 000 ÷ 2 = 156 250 000 000 000 + 0;
  • 156 250 000 000 000 ÷ 2 = 78 125 000 000 000 + 0;
  • 78 125 000 000 000 ÷ 2 = 39 062 500 000 000 + 0;
  • 39 062 500 000 000 ÷ 2 = 19 531 250 000 000 + 0;
  • 19 531 250 000 000 ÷ 2 = 9 765 625 000 000 + 0;
  • 9 765 625 000 000 ÷ 2 = 4 882 812 500 000 + 0;
  • 4 882 812 500 000 ÷ 2 = 2 441 406 250 000 + 0;
  • 2 441 406 250 000 ÷ 2 = 1 220 703 125 000 + 0;
  • 1 220 703 125 000 ÷ 2 = 610 351 562 500 + 0;
  • 610 351 562 500 ÷ 2 = 305 175 781 250 + 0;
  • 305 175 781 250 ÷ 2 = 152 587 890 625 + 0;
  • 152 587 890 625 ÷ 2 = 76 293 945 312 + 1;
  • 76 293 945 312 ÷ 2 = 38 146 972 656 + 0;
  • 38 146 972 656 ÷ 2 = 19 073 486 328 + 0;
  • 19 073 486 328 ÷ 2 = 9 536 743 164 + 0;
  • 9 536 743 164 ÷ 2 = 4 768 371 582 + 0;
  • 4 768 371 582 ÷ 2 = 2 384 185 791 + 0;
  • 2 384 185 791 ÷ 2 = 1 192 092 895 + 1;
  • 1 192 092 895 ÷ 2 = 596 046 447 + 1;
  • 596 046 447 ÷ 2 = 298 023 223 + 1;
  • 298 023 223 ÷ 2 = 149 011 611 + 1;
  • 149 011 611 ÷ 2 = 74 505 805 + 1;
  • 74 505 805 ÷ 2 = 37 252 902 + 1;
  • 37 252 902 ÷ 2 = 18 626 451 + 0;
  • 18 626 451 ÷ 2 = 9 313 225 + 1;
  • 9 313 225 ÷ 2 = 4 656 612 + 1;
  • 4 656 612 ÷ 2 = 2 328 306 + 0;
  • 2 328 306 ÷ 2 = 1 164 153 + 0;
  • 1 164 153 ÷ 2 = 582 076 + 1;
  • 582 076 ÷ 2 = 291 038 + 0;
  • 291 038 ÷ 2 = 145 519 + 0;
  • 145 519 ÷ 2 = 72 759 + 1;
  • 72 759 ÷ 2 = 36 379 + 1;
  • 36 379 ÷ 2 = 18 189 + 1;
  • 18 189 ÷ 2 = 9 094 + 1;
  • 9 094 ÷ 2 = 4 547 + 0;
  • 4 547 ÷ 2 = 2 273 + 1;
  • 2 273 ÷ 2 = 1 136 + 1;
  • 1 136 ÷ 2 = 568 + 0;
  • 568 ÷ 2 = 284 + 0;
  • 284 ÷ 2 = 142 + 0;
  • 142 ÷ 2 = 71 + 0;
  • 71 ÷ 2 = 35 + 1;
  • 35 ÷ 2 = 17 + 1;
  • 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 022(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

10 000 000 000 000 022 (base 10) = 10 0011 1000 0110 1111 0010 0110 1111 1100 0001 0000 0000 0001 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)