By the fundamental theorem of arithmetic, every positive integer has a unique prime factorization.
Given a general algorithm for integer factorization, any integer can be factored down to its constituent prime factors simply by repeated application of this algorithm.