Write as a product of three factors:
Test the small primes in order. is odd, so is out. The digit sum is , a multiple of , so is divisible by both and :
giving the two-factor split . The divisibility-by-3 digit-sum test is what makes this immediate without trial division.
Break any composite factor further. is prime (not divisible by , , or any prime up to ), but is not:
Assemble the three-factor product.
Check: and ✓. This is the prime factorisation, usually written .
Confirm it is the only genuine answer. By unique factorisation, has exactly the prime factors , so any three-factor product without using must be a rearrangement of these. Writing is also technically three factors, but padding with adds nothing — the intended answer uses three factors greater than .
Cross-check by listing all divisors. From the divisors are — six of them, matching the count predicted by the exponents. Every divisor appears in a factor pair: , , ✓.
Need to solve a different problem like this? Open the solver →