Convert 742 167 908 753 881 037 to Unsigned Binary (Base 2)

See below how to convert 742 167 908 753 881 037(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 742 167 908 753 881 037 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;
  • 742 167 908 753 881 037 ÷ 2 = 371 083 954 376 940 518 + 1;
  • 371 083 954 376 940 518 ÷ 2 = 185 541 977 188 470 259 + 0;
  • 185 541 977 188 470 259 ÷ 2 = 92 770 988 594 235 129 + 1;
  • 92 770 988 594 235 129 ÷ 2 = 46 385 494 297 117 564 + 1;
  • 46 385 494 297 117 564 ÷ 2 = 23 192 747 148 558 782 + 0;
  • 23 192 747 148 558 782 ÷ 2 = 11 596 373 574 279 391 + 0;
  • 11 596 373 574 279 391 ÷ 2 = 5 798 186 787 139 695 + 1;
  • 5 798 186 787 139 695 ÷ 2 = 2 899 093 393 569 847 + 1;
  • 2 899 093 393 569 847 ÷ 2 = 1 449 546 696 784 923 + 1;
  • 1 449 546 696 784 923 ÷ 2 = 724 773 348 392 461 + 1;
  • 724 773 348 392 461 ÷ 2 = 362 386 674 196 230 + 1;
  • 362 386 674 196 230 ÷ 2 = 181 193 337 098 115 + 0;
  • 181 193 337 098 115 ÷ 2 = 90 596 668 549 057 + 1;
  • 90 596 668 549 057 ÷ 2 = 45 298 334 274 528 + 1;
  • 45 298 334 274 528 ÷ 2 = 22 649 167 137 264 + 0;
  • 22 649 167 137 264 ÷ 2 = 11 324 583 568 632 + 0;
  • 11 324 583 568 632 ÷ 2 = 5 662 291 784 316 + 0;
  • 5 662 291 784 316 ÷ 2 = 2 831 145 892 158 + 0;
  • 2 831 145 892 158 ÷ 2 = 1 415 572 946 079 + 0;
  • 1 415 572 946 079 ÷ 2 = 707 786 473 039 + 1;
  • 707 786 473 039 ÷ 2 = 353 893 236 519 + 1;
  • 353 893 236 519 ÷ 2 = 176 946 618 259 + 1;
  • 176 946 618 259 ÷ 2 = 88 473 309 129 + 1;
  • 88 473 309 129 ÷ 2 = 44 236 654 564 + 1;
  • 44 236 654 564 ÷ 2 = 22 118 327 282 + 0;
  • 22 118 327 282 ÷ 2 = 11 059 163 641 + 0;
  • 11 059 163 641 ÷ 2 = 5 529 581 820 + 1;
  • 5 529 581 820 ÷ 2 = 2 764 790 910 + 0;
  • 2 764 790 910 ÷ 2 = 1 382 395 455 + 0;
  • 1 382 395 455 ÷ 2 = 691 197 727 + 1;
  • 691 197 727 ÷ 2 = 345 598 863 + 1;
  • 345 598 863 ÷ 2 = 172 799 431 + 1;
  • 172 799 431 ÷ 2 = 86 399 715 + 1;
  • 86 399 715 ÷ 2 = 43 199 857 + 1;
  • 43 199 857 ÷ 2 = 21 599 928 + 1;
  • 21 599 928 ÷ 2 = 10 799 964 + 0;
  • 10 799 964 ÷ 2 = 5 399 982 + 0;
  • 5 399 982 ÷ 2 = 2 699 991 + 0;
  • 2 699 991 ÷ 2 = 1 349 995 + 1;
  • 1 349 995 ÷ 2 = 674 997 + 1;
  • 674 997 ÷ 2 = 337 498 + 1;
  • 337 498 ÷ 2 = 168 749 + 0;
  • 168 749 ÷ 2 = 84 374 + 1;
  • 84 374 ÷ 2 = 42 187 + 0;
  • 42 187 ÷ 2 = 21 093 + 1;
  • 21 093 ÷ 2 = 10 546 + 1;
  • 10 546 ÷ 2 = 5 273 + 0;
  • 5 273 ÷ 2 = 2 636 + 1;
  • 2 636 ÷ 2 = 1 318 + 0;
  • 1 318 ÷ 2 = 659 + 0;
  • 659 ÷ 2 = 329 + 1;
  • 329 ÷ 2 = 164 + 1;
  • 164 ÷ 2 = 82 + 0;
  • 82 ÷ 2 = 41 + 0;
  • 41 ÷ 2 = 20 + 1;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 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.

742 167 908 753 881 037(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

742 167 908 753 881 037 (base 10) = 1010 0100 1100 1011 0101 1100 0111 1110 0100 1111 1000 0011 0111 1100 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)
}?>