Prime Factorization in RSA always leads to the product of two primes? Lets prime factorize $30$:

$$30 = 3 \cdot 10 = 3 \cdot 2 \cdot 5$$

We see that the number $30$ is a product of $3$ primes. But in RSA, when factorizing huge numbers, we always seem to only get two primes. Why is this??
By construction, RSA moduli are the product of two large primes.