# Converter to unsigned binary system (base 2): converting decimal system (base 10) unsigned (positive) integer numbers

## Latest positive integer numbers (unsigned) converted from decimal (base ten) to unsigned binary (base two)

 2 000 003 to unsigned binary (base 2) = ? Nov 30 09:19 UTC (GMT) 759 752 to unsigned binary (base 2) = ? Nov 30 09:18 UTC (GMT) 18 446 744 073 709 550 522 to unsigned binary (base 2) = ? Nov 30 09:18 UTC (GMT) 1 123 680 804 to unsigned binary (base 2) = ? Nov 30 09:17 UTC (GMT) 209 364 to unsigned binary (base 2) = ? Nov 30 09:17 UTC (GMT) 12 to unsigned binary (base 2) = ? Nov 30 09:17 UTC (GMT) 11 110 100 001 010 100 128 to unsigned binary (base 2) = ? Nov 30 09:17 UTC (GMT) 262 123 to unsigned binary (base 2) = ? Nov 30 09:16 UTC (GMT) 45 097 371 to unsigned binary (base 2) = ? Nov 30 09:16 UTC (GMT) 4 646 416 524 655 545 450 to unsigned binary (base 2) = ? Nov 30 09:15 UTC (GMT) 220 120 102 to unsigned binary (base 2) = ? Nov 30 09:15 UTC (GMT) 11 276 572 182 642 644 942 to unsigned binary (base 2) = ? Nov 30 09:15 UTC (GMT) 47 to unsigned binary (base 2) = ? Nov 30 09:15 UTC (GMT) All decimal positive integers converted to unsigned binary (base 2)

## How to convert unsigned integer numbers (positive) from decimal system (base 10) to binary = simply convert from base ten to base two

### 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)