# Base ten decimal system unsigned (positive) integer number 373 converted to unsigned binary (base two)

## How to convert an unsigned (positive) integer in decimal system (in base 10): 373(10) to an unsigned binary (base 2)

### 1. Divide the number repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:

• division = quotient + remainder;
• 373 ÷ 2 = 186 + 1;
• 186 ÷ 2 = 93 + 0;
• 93 ÷ 2 = 46 + 1;
• 46 ÷ 2 = 23 + 0;
• 23 ÷ 2 = 11 + 1;
• 11 ÷ 2 = 5 + 1;
• 5 ÷ 2 = 2 + 1;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

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

 373 = 1 0111 0101 Jan 29 20:52 UTC (GMT) 152 = 1001 1000 Jan 29 20:50 UTC (GMT) 169 = 1010 1001 Jan 29 20:50 UTC (GMT) 32 755 = 111 1111 1111 0011 Jan 29 20:47 UTC (GMT) 33 125 = 1000 0001 0110 0101 Jan 29 20:46 UTC (GMT) 1 333 = 101 0011 0101 Jan 29 20:46 UTC (GMT) 1 951 = 111 1001 1111 Jan 29 20:45 UTC (GMT) 110 101 011 101 = 1 1001 1010 0010 1000 1000 0001 1010 1001 1101 Jan 29 20:45 UTC (GMT) 446 = 1 1011 1110 Jan 29 20:44 UTC (GMT) 16 777 217 = 1 0000 0000 0000 0000 0000 0001 Jan 29 20:42 UTC (GMT) 951 = 11 1011 0111 Jan 29 20:42 UTC (GMT) 5 296 = 1 0100 1011 0000 Jan 29 20:39 UTC (GMT) 5 560 = 1 0101 1011 1000 Jan 29 20:36 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)