Convert 90 000 000 000 000 002 to Unsigned Binary (Base 2)

See below how to convert 90 000 000 000 000 002(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 90 000 000 000 000 002 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;
  • 90 000 000 000 000 002 ÷ 2 = 45 000 000 000 000 001 + 0;
  • 45 000 000 000 000 001 ÷ 2 = 22 500 000 000 000 000 + 1;
  • 22 500 000 000 000 000 ÷ 2 = 11 250 000 000 000 000 + 0;
  • 11 250 000 000 000 000 ÷ 2 = 5 625 000 000 000 000 + 0;
  • 5 625 000 000 000 000 ÷ 2 = 2 812 500 000 000 000 + 0;
  • 2 812 500 000 000 000 ÷ 2 = 1 406 250 000 000 000 + 0;
  • 1 406 250 000 000 000 ÷ 2 = 703 125 000 000 000 + 0;
  • 703 125 000 000 000 ÷ 2 = 351 562 500 000 000 + 0;
  • 351 562 500 000 000 ÷ 2 = 175 781 250 000 000 + 0;
  • 175 781 250 000 000 ÷ 2 = 87 890 625 000 000 + 0;
  • 87 890 625 000 000 ÷ 2 = 43 945 312 500 000 + 0;
  • 43 945 312 500 000 ÷ 2 = 21 972 656 250 000 + 0;
  • 21 972 656 250 000 ÷ 2 = 10 986 328 125 000 + 0;
  • 10 986 328 125 000 ÷ 2 = 5 493 164 062 500 + 0;
  • 5 493 164 062 500 ÷ 2 = 2 746 582 031 250 + 0;
  • 2 746 582 031 250 ÷ 2 = 1 373 291 015 625 + 0;
  • 1 373 291 015 625 ÷ 2 = 686 645 507 812 + 1;
  • 686 645 507 812 ÷ 2 = 343 322 753 906 + 0;
  • 343 322 753 906 ÷ 2 = 171 661 376 953 + 0;
  • 171 661 376 953 ÷ 2 = 85 830 688 476 + 1;
  • 85 830 688 476 ÷ 2 = 42 915 344 238 + 0;
  • 42 915 344 238 ÷ 2 = 21 457 672 119 + 0;
  • 21 457 672 119 ÷ 2 = 10 728 836 059 + 1;
  • 10 728 836 059 ÷ 2 = 5 364 418 029 + 1;
  • 5 364 418 029 ÷ 2 = 2 682 209 014 + 1;
  • 2 682 209 014 ÷ 2 = 1 341 104 507 + 0;
  • 1 341 104 507 ÷ 2 = 670 552 253 + 1;
  • 670 552 253 ÷ 2 = 335 276 126 + 1;
  • 335 276 126 ÷ 2 = 167 638 063 + 0;
  • 167 638 063 ÷ 2 = 83 819 031 + 1;
  • 83 819 031 ÷ 2 = 41 909 515 + 1;
  • 41 909 515 ÷ 2 = 20 954 757 + 1;
  • 20 954 757 ÷ 2 = 10 477 378 + 1;
  • 10 477 378 ÷ 2 = 5 238 689 + 0;
  • 5 238 689 ÷ 2 = 2 619 344 + 1;
  • 2 619 344 ÷ 2 = 1 309 672 + 0;
  • 1 309 672 ÷ 2 = 654 836 + 0;
  • 654 836 ÷ 2 = 327 418 + 0;
  • 327 418 ÷ 2 = 163 709 + 0;
  • 163 709 ÷ 2 = 81 854 + 1;
  • 81 854 ÷ 2 = 40 927 + 0;
  • 40 927 ÷ 2 = 20 463 + 1;
  • 20 463 ÷ 2 = 10 231 + 1;
  • 10 231 ÷ 2 = 5 115 + 1;
  • 5 115 ÷ 2 = 2 557 + 1;
  • 2 557 ÷ 2 = 1 278 + 1;
  • 1 278 ÷ 2 = 639 + 0;
  • 639 ÷ 2 = 319 + 1;
  • 319 ÷ 2 = 159 + 1;
  • 159 ÷ 2 = 79 + 1;
  • 79 ÷ 2 = 39 + 1;
  • 39 ÷ 2 = 19 + 1;
  • 19 ÷ 2 = 9 + 1;
  • 9 ÷ 2 = 4 + 1;
  • 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.

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

90 000 000 000 000 002 (base 10) = 1 0011 1111 1011 1110 1000 0101 1110 1101 1100 1001 0000 0000 0000 0010 (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)