Convert 10 101 000 101 011 010 085 to Unsigned Binary (Base 2)

See below how to convert 10 101 000 101 011 010 085(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 101 000 101 011 010 085 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 101 000 101 011 010 085 ÷ 2 = 5 050 500 050 505 505 042 + 1;
  • 5 050 500 050 505 505 042 ÷ 2 = 2 525 250 025 252 752 521 + 0;
  • 2 525 250 025 252 752 521 ÷ 2 = 1 262 625 012 626 376 260 + 1;
  • 1 262 625 012 626 376 260 ÷ 2 = 631 312 506 313 188 130 + 0;
  • 631 312 506 313 188 130 ÷ 2 = 315 656 253 156 594 065 + 0;
  • 315 656 253 156 594 065 ÷ 2 = 157 828 126 578 297 032 + 1;
  • 157 828 126 578 297 032 ÷ 2 = 78 914 063 289 148 516 + 0;
  • 78 914 063 289 148 516 ÷ 2 = 39 457 031 644 574 258 + 0;
  • 39 457 031 644 574 258 ÷ 2 = 19 728 515 822 287 129 + 0;
  • 19 728 515 822 287 129 ÷ 2 = 9 864 257 911 143 564 + 1;
  • 9 864 257 911 143 564 ÷ 2 = 4 932 128 955 571 782 + 0;
  • 4 932 128 955 571 782 ÷ 2 = 2 466 064 477 785 891 + 0;
  • 2 466 064 477 785 891 ÷ 2 = 1 233 032 238 892 945 + 1;
  • 1 233 032 238 892 945 ÷ 2 = 616 516 119 446 472 + 1;
  • 616 516 119 446 472 ÷ 2 = 308 258 059 723 236 + 0;
  • 308 258 059 723 236 ÷ 2 = 154 129 029 861 618 + 0;
  • 154 129 029 861 618 ÷ 2 = 77 064 514 930 809 + 0;
  • 77 064 514 930 809 ÷ 2 = 38 532 257 465 404 + 1;
  • 38 532 257 465 404 ÷ 2 = 19 266 128 732 702 + 0;
  • 19 266 128 732 702 ÷ 2 = 9 633 064 366 351 + 0;
  • 9 633 064 366 351 ÷ 2 = 4 816 532 183 175 + 1;
  • 4 816 532 183 175 ÷ 2 = 2 408 266 091 587 + 1;
  • 2 408 266 091 587 ÷ 2 = 1 204 133 045 793 + 1;
  • 1 204 133 045 793 ÷ 2 = 602 066 522 896 + 1;
  • 602 066 522 896 ÷ 2 = 301 033 261 448 + 0;
  • 301 033 261 448 ÷ 2 = 150 516 630 724 + 0;
  • 150 516 630 724 ÷ 2 = 75 258 315 362 + 0;
  • 75 258 315 362 ÷ 2 = 37 629 157 681 + 0;
  • 37 629 157 681 ÷ 2 = 18 814 578 840 + 1;
  • 18 814 578 840 ÷ 2 = 9 407 289 420 + 0;
  • 9 407 289 420 ÷ 2 = 4 703 644 710 + 0;
  • 4 703 644 710 ÷ 2 = 2 351 822 355 + 0;
  • 2 351 822 355 ÷ 2 = 1 175 911 177 + 1;
  • 1 175 911 177 ÷ 2 = 587 955 588 + 1;
  • 587 955 588 ÷ 2 = 293 977 794 + 0;
  • 293 977 794 ÷ 2 = 146 988 897 + 0;
  • 146 988 897 ÷ 2 = 73 494 448 + 1;
  • 73 494 448 ÷ 2 = 36 747 224 + 0;
  • 36 747 224 ÷ 2 = 18 373 612 + 0;
  • 18 373 612 ÷ 2 = 9 186 806 + 0;
  • 9 186 806 ÷ 2 = 4 593 403 + 0;
  • 4 593 403 ÷ 2 = 2 296 701 + 1;
  • 2 296 701 ÷ 2 = 1 148 350 + 1;
  • 1 148 350 ÷ 2 = 574 175 + 0;
  • 574 175 ÷ 2 = 287 087 + 1;
  • 287 087 ÷ 2 = 143 543 + 1;
  • 143 543 ÷ 2 = 71 771 + 1;
  • 71 771 ÷ 2 = 35 885 + 1;
  • 35 885 ÷ 2 = 17 942 + 1;
  • 17 942 ÷ 2 = 8 971 + 0;
  • 8 971 ÷ 2 = 4 485 + 1;
  • 4 485 ÷ 2 = 2 242 + 1;
  • 2 242 ÷ 2 = 1 121 + 0;
  • 1 121 ÷ 2 = 560 + 1;
  • 560 ÷ 2 = 280 + 0;
  • 280 ÷ 2 = 140 + 0;
  • 140 ÷ 2 = 70 + 0;
  • 70 ÷ 2 = 35 + 0;
  • 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 101 000 101 011 010 085(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

10 101 000 101 011 010 085 (base 10) = 1000 1100 0010 1101 1111 0110 0001 0011 0001 0000 1111 0010 0011 0010 0010 0101 (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)