In number theory, integer factorization is the decomposition of a composite number into a merchandise of smaller integers. When they are both large, for case more than two thousand bits long, randomly choose, and about the same size (but not too near, for example, to avoid efficient factorization by Fermat's factorization method), even the fastest prime factorization algorithms on the fastest computers can take enough time to make the search impractical; that is, as the number of digits of the primes being factored increases, the number of operations need to perform the factorization on any computer increases drastically.

COMING SOON!

```
package Maths;
import java.lang.Math;
import java.util.Scanner;
public class PrimeFactorization {
public static void main(String[] args){
System.out.println("## all prime factors ##");
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int n = scanner.nextInt();
System.out.print(("printing factors of " + n + " : "));
pfactors(n);
}
public static void pfactors(int n){
while (n%2==0)
{
System.out.print(2 + " ");
n /= 2;
}
for (int i=3; i<= Math.sqrt(n); i+=2)
{
while (n%i == 0)
{
System.out.print(i + " ");
n /= i;
}
}
if(n > 2)
System.out.print(n);
}
}
```