Convert 298 764 321 to Unsigned Binary (Base 2)

See below how to convert 298 764 321(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 298 764 321 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;
  • 298 764 321 ÷ 2 = 149 382 160 + 1;
  • 149 382 160 ÷ 2 = 74 691 080 + 0;
  • 74 691 080 ÷ 2 = 37 345 540 + 0;
  • 37 345 540 ÷ 2 = 18 672 770 + 0;
  • 18 672 770 ÷ 2 = 9 336 385 + 0;
  • 9 336 385 ÷ 2 = 4 668 192 + 1;
  • 4 668 192 ÷ 2 = 2 334 096 + 0;
  • 2 334 096 ÷ 2 = 1 167 048 + 0;
  • 1 167 048 ÷ 2 = 583 524 + 0;
  • 583 524 ÷ 2 = 291 762 + 0;
  • 291 762 ÷ 2 = 145 881 + 0;
  • 145 881 ÷ 2 = 72 940 + 1;
  • 72 940 ÷ 2 = 36 470 + 0;
  • 36 470 ÷ 2 = 18 235 + 0;
  • 18 235 ÷ 2 = 9 117 + 1;
  • 9 117 ÷ 2 = 4 558 + 1;
  • 4 558 ÷ 2 = 2 279 + 0;
  • 2 279 ÷ 2 = 1 139 + 1;
  • 1 139 ÷ 2 = 569 + 1;
  • 569 ÷ 2 = 284 + 1;
  • 284 ÷ 2 = 142 + 0;
  • 142 ÷ 2 = 71 + 0;
  • 71 ÷ 2 = 35 + 1;
  • 35 ÷ 2 = 17 + 1;
  • 17 ÷ 2 = 8 + 1;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 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.

298 764 321(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

298 764 321 (base 10) = 1 0001 1100 1110 1100 1000 0010 0001 (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)