Convert 9 223 372 036 856 090 738 to Unsigned Binary (Base 2)

See below how to convert 9 223 372 036 856 090 738(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 9 223 372 036 856 090 738 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;
  • 9 223 372 036 856 090 738 ÷ 2 = 4 611 686 018 428 045 369 + 0;
  • 4 611 686 018 428 045 369 ÷ 2 = 2 305 843 009 214 022 684 + 1;
  • 2 305 843 009 214 022 684 ÷ 2 = 1 152 921 504 607 011 342 + 0;
  • 1 152 921 504 607 011 342 ÷ 2 = 576 460 752 303 505 671 + 0;
  • 576 460 752 303 505 671 ÷ 2 = 288 230 376 151 752 835 + 1;
  • 288 230 376 151 752 835 ÷ 2 = 144 115 188 075 876 417 + 1;
  • 144 115 188 075 876 417 ÷ 2 = 72 057 594 037 938 208 + 1;
  • 72 057 594 037 938 208 ÷ 2 = 36 028 797 018 969 104 + 0;
  • 36 028 797 018 969 104 ÷ 2 = 18 014 398 509 484 552 + 0;
  • 18 014 398 509 484 552 ÷ 2 = 9 007 199 254 742 276 + 0;
  • 9 007 199 254 742 276 ÷ 2 = 4 503 599 627 371 138 + 0;
  • 4 503 599 627 371 138 ÷ 2 = 2 251 799 813 685 569 + 0;
  • 2 251 799 813 685 569 ÷ 2 = 1 125 899 906 842 784 + 1;
  • 1 125 899 906 842 784 ÷ 2 = 562 949 953 421 392 + 0;
  • 562 949 953 421 392 ÷ 2 = 281 474 976 710 696 + 0;
  • 281 474 976 710 696 ÷ 2 = 140 737 488 355 348 + 0;
  • 140 737 488 355 348 ÷ 2 = 70 368 744 177 674 + 0;
  • 70 368 744 177 674 ÷ 2 = 35 184 372 088 837 + 0;
  • 35 184 372 088 837 ÷ 2 = 17 592 186 044 418 + 1;
  • 17 592 186 044 418 ÷ 2 = 8 796 093 022 209 + 0;
  • 8 796 093 022 209 ÷ 2 = 4 398 046 511 104 + 1;
  • 4 398 046 511 104 ÷ 2 = 2 199 023 255 552 + 0;
  • 2 199 023 255 552 ÷ 2 = 1 099 511 627 776 + 0;
  • 1 099 511 627 776 ÷ 2 = 549 755 813 888 + 0;
  • 549 755 813 888 ÷ 2 = 274 877 906 944 + 0;
  • 274 877 906 944 ÷ 2 = 137 438 953 472 + 0;
  • 137 438 953 472 ÷ 2 = 68 719 476 736 + 0;
  • 68 719 476 736 ÷ 2 = 34 359 738 368 + 0;
  • 34 359 738 368 ÷ 2 = 17 179 869 184 + 0;
  • 17 179 869 184 ÷ 2 = 8 589 934 592 + 0;
  • 8 589 934 592 ÷ 2 = 4 294 967 296 + 0;
  • 4 294 967 296 ÷ 2 = 2 147 483 648 + 0;
  • 2 147 483 648 ÷ 2 = 1 073 741 824 + 0;
  • 1 073 741 824 ÷ 2 = 536 870 912 + 0;
  • 536 870 912 ÷ 2 = 268 435 456 + 0;
  • 268 435 456 ÷ 2 = 134 217 728 + 0;
  • 134 217 728 ÷ 2 = 67 108 864 + 0;
  • 67 108 864 ÷ 2 = 33 554 432 + 0;
  • 33 554 432 ÷ 2 = 16 777 216 + 0;
  • 16 777 216 ÷ 2 = 8 388 608 + 0;
  • 8 388 608 ÷ 2 = 4 194 304 + 0;
  • 4 194 304 ÷ 2 = 2 097 152 + 0;
  • 2 097 152 ÷ 2 = 1 048 576 + 0;
  • 1 048 576 ÷ 2 = 524 288 + 0;
  • 524 288 ÷ 2 = 262 144 + 0;
  • 262 144 ÷ 2 = 131 072 + 0;
  • 131 072 ÷ 2 = 65 536 + 0;
  • 65 536 ÷ 2 = 32 768 + 0;
  • 32 768 ÷ 2 = 16 384 + 0;
  • 16 384 ÷ 2 = 8 192 + 0;
  • 8 192 ÷ 2 = 4 096 + 0;
  • 4 096 ÷ 2 = 2 048 + 0;
  • 2 048 ÷ 2 = 1 024 + 0;
  • 1 024 ÷ 2 = 512 + 0;
  • 512 ÷ 2 = 256 + 0;
  • 256 ÷ 2 = 128 + 0;
  • 128 ÷ 2 = 64 + 0;
  • 64 ÷ 2 = 32 + 0;
  • 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.

9 223 372 036 856 090 738(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

9 223 372 036 856 090 738 (base 10) = 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0100 0001 0000 0111 0010 (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)
}?>