Hint $\rm\ $ prime $\rm\ p\: |\: n^k\ \Rightarrow\ p\: |\: n\ $ by uniqueness of prime factorizations.
Note $\ $ In fact uniqueness of factorizations into primes (i.e. atoms) is equivalent to the following
Prime Divisor Property $\rm\quad p\ |\ a\:b\ \Rightarrow\ p\:|\:a\ $ or $\rm\ p\:|\:b,\ $ for all primes $\rm\:p\,;\:\: $ more generally
Primal Divisor Property $\rm\ \ \: c\ |\ a\:b\ \Rightarrow\ c_1\, |\: a\:,\: $ $\rm\ c_2\:|\:b,\ \ c = c_1\:c_2,\ $ for all $\rm\:c$
The latter property may be considered to be a generalization of the prime divisor property from atoms to composites (one easily checks that atoms are primal $\Leftrightarrow$ prime). This leads to various "refinement" views of unique factorizations, e.g. the Euclid-Euler Four Number Theorem (Vierzahlensatz), or Schreier refinement and Riesz interpolation, etc, which prove more natural in noncommutative rings - see Paul Cohn's 1973 Monthly survey Unique Factorization Domains.