Prime Factorisation using JavaScript

JavaScript to compute Prime Factorisation:

<SCRIPT><!--
var number, factor, power;

for (i=1; i<=200; i++)
{
number = i;
factor = 2;
power = 0;
document.write(number + " = ");
while (number >= factor*factor)
   {
   if ((number%factor) == 0) //a factor has been found
     {
     power = power + 1;
     number = Math.round(number/factor);
     }
   else //factor cannot divide the number
     {
     if (power > 1)
       document.write(factor + "<SUP>" + power + "</SUP> x ")
     else if (power == 1)
       document.write(factor + " x ");
     if (factor > 2)
       factor = factor + 2
     else factor = 3;
     power = 0;
     } //end of else
   } //end of while

if (number == factor)
  document.write(factor + "<SUP>" + (power+1) +"</SUP>")
else if (power > 1)
  document.write(factor + "<SUP>" + power + "</SUP> x " + number)
else if (power == 1)
  document.write(factor + " x " + number)
else document.write(number)
document.write("<BR>");

} //end of for i
//--></SCRIPT>