Convert 10 009 494 975 586 764 873 to Unsigned Binary (Base 2)

See below how to convert 10 009 494 975 586 764 873(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 009 494 975 586 764 873 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 009 494 975 586 764 873 ÷ 2 = 5 004 747 487 793 382 436 + 1;
  • 5 004 747 487 793 382 436 ÷ 2 = 2 502 373 743 896 691 218 + 0;
  • 2 502 373 743 896 691 218 ÷ 2 = 1 251 186 871 948 345 609 + 0;
  • 1 251 186 871 948 345 609 ÷ 2 = 625 593 435 974 172 804 + 1;
  • 625 593 435 974 172 804 ÷ 2 = 312 796 717 987 086 402 + 0;
  • 312 796 717 987 086 402 ÷ 2 = 156 398 358 993 543 201 + 0;
  • 156 398 358 993 543 201 ÷ 2 = 78 199 179 496 771 600 + 1;
  • 78 199 179 496 771 600 ÷ 2 = 39 099 589 748 385 800 + 0;
  • 39 099 589 748 385 800 ÷ 2 = 19 549 794 874 192 900 + 0;
  • 19 549 794 874 192 900 ÷ 2 = 9 774 897 437 096 450 + 0;
  • 9 774 897 437 096 450 ÷ 2 = 4 887 448 718 548 225 + 0;
  • 4 887 448 718 548 225 ÷ 2 = 2 443 724 359 274 112 + 1;
  • 2 443 724 359 274 112 ÷ 2 = 1 221 862 179 637 056 + 0;
  • 1 221 862 179 637 056 ÷ 2 = 610 931 089 818 528 + 0;
  • 610 931 089 818 528 ÷ 2 = 305 465 544 909 264 + 0;
  • 305 465 544 909 264 ÷ 2 = 152 732 772 454 632 + 0;
  • 152 732 772 454 632 ÷ 2 = 76 366 386 227 316 + 0;
  • 76 366 386 227 316 ÷ 2 = 38 183 193 113 658 + 0;
  • 38 183 193 113 658 ÷ 2 = 19 091 596 556 829 + 0;
  • 19 091 596 556 829 ÷ 2 = 9 545 798 278 414 + 1;
  • 9 545 798 278 414 ÷ 2 = 4 772 899 139 207 + 0;
  • 4 772 899 139 207 ÷ 2 = 2 386 449 569 603 + 1;
  • 2 386 449 569 603 ÷ 2 = 1 193 224 784 801 + 1;
  • 1 193 224 784 801 ÷ 2 = 596 612 392 400 + 1;
  • 596 612 392 400 ÷ 2 = 298 306 196 200 + 0;
  • 298 306 196 200 ÷ 2 = 149 153 098 100 + 0;
  • 149 153 098 100 ÷ 2 = 74 576 549 050 + 0;
  • 74 576 549 050 ÷ 2 = 37 288 274 525 + 0;
  • 37 288 274 525 ÷ 2 = 18 644 137 262 + 1;
  • 18 644 137 262 ÷ 2 = 9 322 068 631 + 0;
  • 9 322 068 631 ÷ 2 = 4 661 034 315 + 1;
  • 4 661 034 315 ÷ 2 = 2 330 517 157 + 1;
  • 2 330 517 157 ÷ 2 = 1 165 258 578 + 1;
  • 1 165 258 578 ÷ 2 = 582 629 289 + 0;
  • 582 629 289 ÷ 2 = 291 314 644 + 1;
  • 291 314 644 ÷ 2 = 145 657 322 + 0;
  • 145 657 322 ÷ 2 = 72 828 661 + 0;
  • 72 828 661 ÷ 2 = 36 414 330 + 1;
  • 36 414 330 ÷ 2 = 18 207 165 + 0;
  • 18 207 165 ÷ 2 = 9 103 582 + 1;
  • 9 103 582 ÷ 2 = 4 551 791 + 0;
  • 4 551 791 ÷ 2 = 2 275 895 + 1;
  • 2 275 895 ÷ 2 = 1 137 947 + 1;
  • 1 137 947 ÷ 2 = 568 973 + 1;
  • 568 973 ÷ 2 = 284 486 + 1;
  • 284 486 ÷ 2 = 142 243 + 0;
  • 142 243 ÷ 2 = 71 121 + 1;
  • 71 121 ÷ 2 = 35 560 + 1;
  • 35 560 ÷ 2 = 17 780 + 0;
  • 17 780 ÷ 2 = 8 890 + 0;
  • 8 890 ÷ 2 = 4 445 + 0;
  • 4 445 ÷ 2 = 2 222 + 1;
  • 2 222 ÷ 2 = 1 111 + 0;
  • 1 111 ÷ 2 = 555 + 1;
  • 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 009 494 975 586 764 873(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

10 009 494 975 586 764 873 (base 10) = 1000 1010 1110 1000 1101 1110 1010 0101 1101 0000 1110 1000 0000 1000 0100 1001 (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)