Convert 123 456 789 012 346 155 to Unsigned Binary (Base 2)

See below how to convert 123 456 789 012 346 155(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 123 456 789 012 346 155 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;
  • 123 456 789 012 346 155 ÷ 2 = 61 728 394 506 173 077 + 1;
  • 61 728 394 506 173 077 ÷ 2 = 30 864 197 253 086 538 + 1;
  • 30 864 197 253 086 538 ÷ 2 = 15 432 098 626 543 269 + 0;
  • 15 432 098 626 543 269 ÷ 2 = 7 716 049 313 271 634 + 1;
  • 7 716 049 313 271 634 ÷ 2 = 3 858 024 656 635 817 + 0;
  • 3 858 024 656 635 817 ÷ 2 = 1 929 012 328 317 908 + 1;
  • 1 929 012 328 317 908 ÷ 2 = 964 506 164 158 954 + 0;
  • 964 506 164 158 954 ÷ 2 = 482 253 082 079 477 + 0;
  • 482 253 082 079 477 ÷ 2 = 241 126 541 039 738 + 1;
  • 241 126 541 039 738 ÷ 2 = 120 563 270 519 869 + 0;
  • 120 563 270 519 869 ÷ 2 = 60 281 635 259 934 + 1;
  • 60 281 635 259 934 ÷ 2 = 30 140 817 629 967 + 0;
  • 30 140 817 629 967 ÷ 2 = 15 070 408 814 983 + 1;
  • 15 070 408 814 983 ÷ 2 = 7 535 204 407 491 + 1;
  • 7 535 204 407 491 ÷ 2 = 3 767 602 203 745 + 1;
  • 3 767 602 203 745 ÷ 2 = 1 883 801 101 872 + 1;
  • 1 883 801 101 872 ÷ 2 = 941 900 550 936 + 0;
  • 941 900 550 936 ÷ 2 = 470 950 275 468 + 0;
  • 470 950 275 468 ÷ 2 = 235 475 137 734 + 0;
  • 235 475 137 734 ÷ 2 = 117 737 568 867 + 0;
  • 117 737 568 867 ÷ 2 = 58 868 784 433 + 1;
  • 58 868 784 433 ÷ 2 = 29 434 392 216 + 1;
  • 29 434 392 216 ÷ 2 = 14 717 196 108 + 0;
  • 14 717 196 108 ÷ 2 = 7 358 598 054 + 0;
  • 7 358 598 054 ÷ 2 = 3 679 299 027 + 0;
  • 3 679 299 027 ÷ 2 = 1 839 649 513 + 1;
  • 1 839 649 513 ÷ 2 = 919 824 756 + 1;
  • 919 824 756 ÷ 2 = 459 912 378 + 0;
  • 459 912 378 ÷ 2 = 229 956 189 + 0;
  • 229 956 189 ÷ 2 = 114 978 094 + 1;
  • 114 978 094 ÷ 2 = 57 489 047 + 0;
  • 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.

123 456 789 012 346 155(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

123 456 789 012 346 155 (base 10) = 1 1011 0110 1001 1011 0100 1011 1010 0110 0011 0000 1111 0101 0010 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)