;Task:
Write a program which counts up from   '''1''',   displaying each number as the multiplication of its prime factors.

For the purpose of this task,   '''1'''   (unity)   may be shown as itself.


;Example:
      '''2'''   is prime,   so it would be shown as itself.
<br>&nbsp; &nbsp; &nbsp; '''6''' &nbsp; is not prime; &nbsp; it would be shown as &nbsp; '''<math>2\times3</math>.'''
<br>'''2144''' &nbsp; is not prime; &nbsp; it would be shown as &nbsp; '''<math>2\times2\times2\times2\times2\times67</math>.'''


;Related tasks:
* &nbsp; [[prime decomposition]]
* &nbsp; [[factors of an integer]]
* &nbsp; [[Sieve of Eratosthenes]]
* &nbsp; [[primality by trial division]]
* &nbsp; [[factors of a Mersenne number]]
* &nbsp; [[trial factoring of a Mersenne number]]
* &nbsp; [[partition an integer X into N primes]]
<br><br>