Convert 987 654 321 123 456 861 to Unsigned Binary (Base 2)

See below how to convert 987 654 321 123 456 861(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 987 654 321 123 456 861 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;
  • 987 654 321 123 456 861 ÷ 2 = 493 827 160 561 728 430 + 1;
  • 493 827 160 561 728 430 ÷ 2 = 246 913 580 280 864 215 + 0;
  • 246 913 580 280 864 215 ÷ 2 = 123 456 790 140 432 107 + 1;
  • 123 456 790 140 432 107 ÷ 2 = 61 728 395 070 216 053 + 1;
  • 61 728 395 070 216 053 ÷ 2 = 30 864 197 535 108 026 + 1;
  • 30 864 197 535 108 026 ÷ 2 = 15 432 098 767 554 013 + 0;
  • 15 432 098 767 554 013 ÷ 2 = 7 716 049 383 777 006 + 1;
  • 7 716 049 383 777 006 ÷ 2 = 3 858 024 691 888 503 + 0;
  • 3 858 024 691 888 503 ÷ 2 = 1 929 012 345 944 251 + 1;
  • 1 929 012 345 944 251 ÷ 2 = 964 506 172 972 125 + 1;
  • 964 506 172 972 125 ÷ 2 = 482 253 086 486 062 + 1;
  • 482 253 086 486 062 ÷ 2 = 241 126 543 243 031 + 0;
  • 241 126 543 243 031 ÷ 2 = 120 563 271 621 515 + 1;
  • 120 563 271 621 515 ÷ 2 = 60 281 635 810 757 + 1;
  • 60 281 635 810 757 ÷ 2 = 30 140 817 905 378 + 1;
  • 30 140 817 905 378 ÷ 2 = 15 070 408 952 689 + 0;
  • 15 070 408 952 689 ÷ 2 = 7 535 204 476 344 + 1;
  • 7 535 204 476 344 ÷ 2 = 3 767 602 238 172 + 0;
  • 3 767 602 238 172 ÷ 2 = 1 883 801 119 086 + 0;
  • 1 883 801 119 086 ÷ 2 = 941 900 559 543 + 0;
  • 941 900 559 543 ÷ 2 = 470 950 279 771 + 1;
  • 470 950 279 771 ÷ 2 = 235 475 139 885 + 1;
  • 235 475 139 885 ÷ 2 = 117 737 569 942 + 1;
  • 117 737 569 942 ÷ 2 = 58 868 784 971 + 0;
  • 58 868 784 971 ÷ 2 = 29 434 392 485 + 1;
  • 29 434 392 485 ÷ 2 = 14 717 196 242 + 1;
  • 14 717 196 242 ÷ 2 = 7 358 598 121 + 0;
  • 7 358 598 121 ÷ 2 = 3 679 299 060 + 1;
  • 3 679 299 060 ÷ 2 = 1 839 649 530 + 0;
  • 1 839 649 530 ÷ 2 = 919 824 765 + 0;
  • 919 824 765 ÷ 2 = 459 912 382 + 1;
  • 459 912 382 ÷ 2 = 229 956 191 + 0;
  • 229 956 191 ÷ 2 = 114 978 095 + 1;
  • 114 978 095 ÷ 2 = 57 489 047 + 1;
  • 57 489 047 ÷ 2 = 28 744 523 + 1;
  • 28 744 523 ÷ 2 = 14 372 261 + 1;
  • 14 372 261 ÷ 2 = 7 186 130 + 1;
  • 7 186 130 ÷ 2 = 3 593 065 + 0;
  • 3 593 065 ÷ 2 = 1 796 532 + 1;
  • 1 796 532 ÷ 2 = 898 266 + 0;
  • 898 266 ÷ 2 = 449 133 + 0;
  • 449 133 ÷ 2 = 224 566 + 1;
  • 224 566 ÷ 2 = 112 283 + 0;
  • 112 283 ÷ 2 = 56 141 + 1;
  • 56 141 ÷ 2 = 28 070 + 1;
  • 28 070 ÷ 2 = 14 035 + 0;
  • 14 035 ÷ 2 = 7 017 + 1;
  • 7 017 ÷ 2 = 3 508 + 1;
  • 3 508 ÷ 2 = 1 754 + 0;
  • 1 754 ÷ 2 = 877 + 0;
  • 877 ÷ 2 = 438 + 1;
  • 438 ÷ 2 = 219 + 0;
  • 219 ÷ 2 = 109 + 1;
  • 109 ÷ 2 = 54 + 1;
  • 54 ÷ 2 = 27 + 0;
  • 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 number:

Take all the remainders starting from the bottom of the list constructed above.

987 654 321 123 456 861(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

987 654 321 123 456 861 (base 10) = 1101 1011 0100 1101 1010 0101 1111 0100 1011 0111 0001 0111 0111 0101 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)