def get_prime_factors(n):
factors = []
divisor = 2
while n > 1:
if n % divisor == 0:
factors.append(divisor)
n //= divisor
else:
divisor += 1
return factors
n = 72
ret = get_prime_factors(n)
print(ret) # [2, 2, 2, 3, 3]
To embed this project on your website, copy the following code and paste it into your website's HTML: