Adjust the inputs below. Results update as you type.
Every integer > 1 is either prime or can be uniquely expressed as a product of primes (Fundamental Theorem of Arithmetic). Trial division: test primes 2, 3, 5, 7, ... up to √n. If none divide evenly, n is prime. Example: 360 = 2³ × 3² × 5. Used to find GCF, LCM, and simplify radicals. Large-number factorization is computationally hard—it underpins RSA encryption security.
Prime factors
2 × 2 × 2 × 3 × 3 × 5