Convert 8 997 994 053 185 349 477 to Unsigned Binary (Base 2)

See below how to convert 8 997 994 053 185 349 477(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 8 997 994 053 185 349 477 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;
  • 8 997 994 053 185 349 477 ÷ 2 = 4 498 997 026 592 674 738 + 1;
  • 4 498 997 026 592 674 738 ÷ 2 = 2 249 498 513 296 337 369 + 0;
  • 2 249 498 513 296 337 369 ÷ 2 = 1 124 749 256 648 168 684 + 1;
  • 1 124 749 256 648 168 684 ÷ 2 = 562 374 628 324 084 342 + 0;
  • 562 374 628 324 084 342 ÷ 2 = 281 187 314 162 042 171 + 0;
  • 281 187 314 162 042 171 ÷ 2 = 140 593 657 081 021 085 + 1;
  • 140 593 657 081 021 085 ÷ 2 = 70 296 828 540 510 542 + 1;
  • 70 296 828 540 510 542 ÷ 2 = 35 148 414 270 255 271 + 0;
  • 35 148 414 270 255 271 ÷ 2 = 17 574 207 135 127 635 + 1;
  • 17 574 207 135 127 635 ÷ 2 = 8 787 103 567 563 817 + 1;
  • 8 787 103 567 563 817 ÷ 2 = 4 393 551 783 781 908 + 1;
  • 4 393 551 783 781 908 ÷ 2 = 2 196 775 891 890 954 + 0;
  • 2 196 775 891 890 954 ÷ 2 = 1 098 387 945 945 477 + 0;
  • 1 098 387 945 945 477 ÷ 2 = 549 193 972 972 738 + 1;
  • 549 193 972 972 738 ÷ 2 = 274 596 986 486 369 + 0;
  • 274 596 986 486 369 ÷ 2 = 137 298 493 243 184 + 1;
  • 137 298 493 243 184 ÷ 2 = 68 649 246 621 592 + 0;
  • 68 649 246 621 592 ÷ 2 = 34 324 623 310 796 + 0;
  • 34 324 623 310 796 ÷ 2 = 17 162 311 655 398 + 0;
  • 17 162 311 655 398 ÷ 2 = 8 581 155 827 699 + 0;
  • 8 581 155 827 699 ÷ 2 = 4 290 577 913 849 + 1;
  • 4 290 577 913 849 ÷ 2 = 2 145 288 956 924 + 1;
  • 2 145 288 956 924 ÷ 2 = 1 072 644 478 462 + 0;
  • 1 072 644 478 462 ÷ 2 = 536 322 239 231 + 0;
  • 536 322 239 231 ÷ 2 = 268 161 119 615 + 1;
  • 268 161 119 615 ÷ 2 = 134 080 559 807 + 1;
  • 134 080 559 807 ÷ 2 = 67 040 279 903 + 1;
  • 67 040 279 903 ÷ 2 = 33 520 139 951 + 1;
  • 33 520 139 951 ÷ 2 = 16 760 069 975 + 1;
  • 16 760 069 975 ÷ 2 = 8 380 034 987 + 1;
  • 8 380 034 987 ÷ 2 = 4 190 017 493 + 1;
  • 4 190 017 493 ÷ 2 = 2 095 008 746 + 1;
  • 2 095 008 746 ÷ 2 = 1 047 504 373 + 0;
  • 1 047 504 373 ÷ 2 = 523 752 186 + 1;
  • 523 752 186 ÷ 2 = 261 876 093 + 0;
  • 261 876 093 ÷ 2 = 130 938 046 + 1;
  • 130 938 046 ÷ 2 = 65 469 023 + 0;
  • 65 469 023 ÷ 2 = 32 734 511 + 1;
  • 32 734 511 ÷ 2 = 16 367 255 + 1;
  • 16 367 255 ÷ 2 = 8 183 627 + 1;
  • 8 183 627 ÷ 2 = 4 091 813 + 1;
  • 4 091 813 ÷ 2 = 2 045 906 + 1;
  • 2 045 906 ÷ 2 = 1 022 953 + 0;
  • 1 022 953 ÷ 2 = 511 476 + 1;
  • 511 476 ÷ 2 = 255 738 + 0;
  • 255 738 ÷ 2 = 127 869 + 0;
  • 127 869 ÷ 2 = 63 934 + 1;
  • 63 934 ÷ 2 = 31 967 + 0;
  • 31 967 ÷ 2 = 15 983 + 1;
  • 15 983 ÷ 2 = 7 991 + 1;
  • 7 991 ÷ 2 = 3 995 + 1;
  • 3 995 ÷ 2 = 1 997 + 1;
  • 1 997 ÷ 2 = 998 + 1;
  • 998 ÷ 2 = 499 + 0;
  • 499 ÷ 2 = 249 + 1;
  • 249 ÷ 2 = 124 + 1;
  • 124 ÷ 2 = 62 + 0;
  • 62 ÷ 2 = 31 + 0;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 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.

8 997 994 053 185 349 477(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

8 997 994 053 185 349 477 (base 10) = 111 1100 1101 1111 0100 1011 1110 1010 1111 1111 0011 0000 1010 0111 0110 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)
}?>