Convert 9 223 372 049 739 677 787 to Unsigned Binary (Base 2)

See below how to convert 9 223 372 049 739 677 787(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 049 739 677 787 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 049 739 677 787 ÷ 2 = 4 611 686 024 869 838 893 + 1;
  • 4 611 686 024 869 838 893 ÷ 2 = 2 305 843 012 434 919 446 + 1;
  • 2 305 843 012 434 919 446 ÷ 2 = 1 152 921 506 217 459 723 + 0;
  • 1 152 921 506 217 459 723 ÷ 2 = 576 460 753 108 729 861 + 1;
  • 576 460 753 108 729 861 ÷ 2 = 288 230 376 554 364 930 + 1;
  • 288 230 376 554 364 930 ÷ 2 = 144 115 188 277 182 465 + 0;
  • 144 115 188 277 182 465 ÷ 2 = 72 057 594 138 591 232 + 1;
  • 72 057 594 138 591 232 ÷ 2 = 36 028 797 069 295 616 + 0;
  • 36 028 797 069 295 616 ÷ 2 = 18 014 398 534 647 808 + 0;
  • 18 014 398 534 647 808 ÷ 2 = 9 007 199 267 323 904 + 0;
  • 9 007 199 267 323 904 ÷ 2 = 4 503 599 633 661 952 + 0;
  • 4 503 599 633 661 952 ÷ 2 = 2 251 799 816 830 976 + 0;
  • 2 251 799 816 830 976 ÷ 2 = 1 125 899 908 415 488 + 0;
  • 1 125 899 908 415 488 ÷ 2 = 562 949 954 207 744 + 0;
  • 562 949 954 207 744 ÷ 2 = 281 474 977 103 872 + 0;
  • 281 474 977 103 872 ÷ 2 = 140 737 488 551 936 + 0;
  • 140 737 488 551 936 ÷ 2 = 70 368 744 275 968 + 0;
  • 70 368 744 275 968 ÷ 2 = 35 184 372 137 984 + 0;
  • 35 184 372 137 984 ÷ 2 = 17 592 186 068 992 + 0;
  • 17 592 186 068 992 ÷ 2 = 8 796 093 034 496 + 0;
  • 8 796 093 034 496 ÷ 2 = 4 398 046 517 248 + 0;
  • 4 398 046 517 248 ÷ 2 = 2 199 023 258 624 + 0;
  • 2 199 023 258 624 ÷ 2 = 1 099 511 629 312 + 0;
  • 1 099 511 629 312 ÷ 2 = 549 755 814 656 + 0;
  • 549 755 814 656 ÷ 2 = 274 877 907 328 + 0;
  • 274 877 907 328 ÷ 2 = 137 438 953 664 + 0;
  • 137 438 953 664 ÷ 2 = 68 719 476 832 + 0;
  • 68 719 476 832 ÷ 2 = 34 359 738 416 + 0;
  • 34 359 738 416 ÷ 2 = 17 179 869 208 + 0;
  • 17 179 869 208 ÷ 2 = 8 589 934 604 + 0;
  • 8 589 934 604 ÷ 2 = 4 294 967 302 + 0;
  • 4 294 967 302 ÷ 2 = 2 147 483 651 + 0;
  • 2 147 483 651 ÷ 2 = 1 073 741 825 + 1;
  • 1 073 741 825 ÷ 2 = 536 870 912 + 1;
  • 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 049 739 677 787(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

9 223 372 049 739 677 787 (base 10) = 1000 0000 0000 0000 0000 0000 0000 0011 0000 0000 0000 0000 0000 0000 0101 1011 (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)