Convert 18 446 744 000 000 323 to Unsigned Binary (Base 2)

See below how to convert 18 446 744 000 000 323(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 18 446 744 000 000 323 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;
  • 18 446 744 000 000 323 ÷ 2 = 9 223 372 000 000 161 + 1;
  • 9 223 372 000 000 161 ÷ 2 = 4 611 686 000 000 080 + 1;
  • 4 611 686 000 000 080 ÷ 2 = 2 305 843 000 000 040 + 0;
  • 2 305 843 000 000 040 ÷ 2 = 1 152 921 500 000 020 + 0;
  • 1 152 921 500 000 020 ÷ 2 = 576 460 750 000 010 + 0;
  • 576 460 750 000 010 ÷ 2 = 288 230 375 000 005 + 0;
  • 288 230 375 000 005 ÷ 2 = 144 115 187 500 002 + 1;
  • 144 115 187 500 002 ÷ 2 = 72 057 593 750 001 + 0;
  • 72 057 593 750 001 ÷ 2 = 36 028 796 875 000 + 1;
  • 36 028 796 875 000 ÷ 2 = 18 014 398 437 500 + 0;
  • 18 014 398 437 500 ÷ 2 = 9 007 199 218 750 + 0;
  • 9 007 199 218 750 ÷ 2 = 4 503 599 609 375 + 0;
  • 4 503 599 609 375 ÷ 2 = 2 251 799 804 687 + 1;
  • 2 251 799 804 687 ÷ 2 = 1 125 899 902 343 + 1;
  • 1 125 899 902 343 ÷ 2 = 562 949 951 171 + 1;
  • 562 949 951 171 ÷ 2 = 281 474 975 585 + 1;
  • 281 474 975 585 ÷ 2 = 140 737 487 792 + 1;
  • 140 737 487 792 ÷ 2 = 70 368 743 896 + 0;
  • 70 368 743 896 ÷ 2 = 35 184 371 948 + 0;
  • 35 184 371 948 ÷ 2 = 17 592 185 974 + 0;
  • 17 592 185 974 ÷ 2 = 8 796 092 987 + 0;
  • 8 796 092 987 ÷ 2 = 4 398 046 493 + 1;
  • 4 398 046 493 ÷ 2 = 2 199 023 246 + 1;
  • 2 199 023 246 ÷ 2 = 1 099 511 623 + 0;
  • 1 099 511 623 ÷ 2 = 549 755 811 + 1;
  • 549 755 811 ÷ 2 = 274 877 905 + 1;
  • 274 877 905 ÷ 2 = 137 438 952 + 1;
  • 137 438 952 ÷ 2 = 68 719 476 + 0;
  • 68 719 476 ÷ 2 = 34 359 738 + 0;
  • 34 359 738 ÷ 2 = 17 179 869 + 0;
  • 17 179 869 ÷ 2 = 8 589 934 + 1;
  • 8 589 934 ÷ 2 = 4 294 967 + 0;
  • 4 294 967 ÷ 2 = 2 147 483 + 1;
  • 2 147 483 ÷ 2 = 1 073 741 + 1;
  • 1 073 741 ÷ 2 = 536 870 + 1;
  • 536 870 ÷ 2 = 268 435 + 0;
  • 268 435 ÷ 2 = 134 217 + 1;
  • 134 217 ÷ 2 = 67 108 + 1;
  • 67 108 ÷ 2 = 33 554 + 0;
  • 33 554 ÷ 2 = 16 777 + 0;
  • 16 777 ÷ 2 = 8 388 + 1;
  • 8 388 ÷ 2 = 4 194 + 0;
  • 4 194 ÷ 2 = 2 097 + 0;
  • 2 097 ÷ 2 = 1 048 + 1;
  • 1 048 ÷ 2 = 524 + 0;
  • 524 ÷ 2 = 262 + 0;
  • 262 ÷ 2 = 131 + 0;
  • 131 ÷ 2 = 65 + 1;
  • 65 ÷ 2 = 32 + 1;
  • 32 ÷ 2 = 16 + 0;
  • 16 ÷ 2 = 8 + 0;
  • 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.

18 446 744 000 000 323(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

18 446 744 000 000 323 (base 10) = 100 0001 1000 1001 0011 0111 0100 0111 0110 0001 1111 0001 0100 0011 (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)