Convert 13 835 058 009 648 136 317 to Unsigned Binary (Base 2)

See below how to convert 13 835 058 009 648 136 317(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 13 835 058 009 648 136 317 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;
  • 13 835 058 009 648 136 317 ÷ 2 = 6 917 529 004 824 068 158 + 1;
  • 6 917 529 004 824 068 158 ÷ 2 = 3 458 764 502 412 034 079 + 0;
  • 3 458 764 502 412 034 079 ÷ 2 = 1 729 382 251 206 017 039 + 1;
  • 1 729 382 251 206 017 039 ÷ 2 = 864 691 125 603 008 519 + 1;
  • 864 691 125 603 008 519 ÷ 2 = 432 345 562 801 504 259 + 1;
  • 432 345 562 801 504 259 ÷ 2 = 216 172 781 400 752 129 + 1;
  • 216 172 781 400 752 129 ÷ 2 = 108 086 390 700 376 064 + 1;
  • 108 086 390 700 376 064 ÷ 2 = 54 043 195 350 188 032 + 0;
  • 54 043 195 350 188 032 ÷ 2 = 27 021 597 675 094 016 + 0;
  • 27 021 597 675 094 016 ÷ 2 = 13 510 798 837 547 008 + 0;
  • 13 510 798 837 547 008 ÷ 2 = 6 755 399 418 773 504 + 0;
  • 6 755 399 418 773 504 ÷ 2 = 3 377 699 709 386 752 + 0;
  • 3 377 699 709 386 752 ÷ 2 = 1 688 849 854 693 376 + 0;
  • 1 688 849 854 693 376 ÷ 2 = 844 424 927 346 688 + 0;
  • 844 424 927 346 688 ÷ 2 = 422 212 463 673 344 + 0;
  • 422 212 463 673 344 ÷ 2 = 211 106 231 836 672 + 0;
  • 211 106 231 836 672 ÷ 2 = 105 553 115 918 336 + 0;
  • 105 553 115 918 336 ÷ 2 = 52 776 557 959 168 + 0;
  • 52 776 557 959 168 ÷ 2 = 26 388 278 979 584 + 0;
  • 26 388 278 979 584 ÷ 2 = 13 194 139 489 792 + 0;
  • 13 194 139 489 792 ÷ 2 = 6 597 069 744 896 + 0;
  • 6 597 069 744 896 ÷ 2 = 3 298 534 872 448 + 0;
  • 3 298 534 872 448 ÷ 2 = 1 649 267 436 224 + 0;
  • 1 649 267 436 224 ÷ 2 = 824 633 718 112 + 0;
  • 824 633 718 112 ÷ 2 = 412 316 859 056 + 0;
  • 412 316 859 056 ÷ 2 = 206 158 429 528 + 0;
  • 206 158 429 528 ÷ 2 = 103 079 214 764 + 0;
  • 103 079 214 764 ÷ 2 = 51 539 607 382 + 0;
  • 51 539 607 382 ÷ 2 = 25 769 803 691 + 0;
  • 25 769 803 691 ÷ 2 = 12 884 901 845 + 1;
  • 12 884 901 845 ÷ 2 = 6 442 450 922 + 1;
  • 6 442 450 922 ÷ 2 = 3 221 225 461 + 0;
  • 3 221 225 461 ÷ 2 = 1 610 612 730 + 1;
  • 1 610 612 730 ÷ 2 = 805 306 365 + 0;
  • 805 306 365 ÷ 2 = 402 653 182 + 1;
  • 402 653 182 ÷ 2 = 201 326 591 + 0;
  • 201 326 591 ÷ 2 = 100 663 295 + 1;
  • 100 663 295 ÷ 2 = 50 331 647 + 1;
  • 50 331 647 ÷ 2 = 25 165 823 + 1;
  • 25 165 823 ÷ 2 = 12 582 911 + 1;
  • 12 582 911 ÷ 2 = 6 291 455 + 1;
  • 6 291 455 ÷ 2 = 3 145 727 + 1;
  • 3 145 727 ÷ 2 = 1 572 863 + 1;
  • 1 572 863 ÷ 2 = 786 431 + 1;
  • 786 431 ÷ 2 = 393 215 + 1;
  • 393 215 ÷ 2 = 196 607 + 1;
  • 196 607 ÷ 2 = 98 303 + 1;
  • 98 303 ÷ 2 = 49 151 + 1;
  • 49 151 ÷ 2 = 24 575 + 1;
  • 24 575 ÷ 2 = 12 287 + 1;
  • 12 287 ÷ 2 = 6 143 + 1;
  • 6 143 ÷ 2 = 3 071 + 1;
  • 3 071 ÷ 2 = 1 535 + 1;
  • 1 535 ÷ 2 = 767 + 1;
  • 767 ÷ 2 = 383 + 1;
  • 383 ÷ 2 = 191 + 1;
  • 191 ÷ 2 = 95 + 1;
  • 95 ÷ 2 = 47 + 1;
  • 47 ÷ 2 = 23 + 1;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 5 ÷ 2 = 2 + 1;
  • 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.

13 835 058 009 648 136 317(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

13 835 058 009 648 136 317 (base 10) = 1011 1111 1111 1111 1111 1111 1111 0101 0110 0000 0000 0000 0000 0000 0111 1101 (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)