xxxxxxxxxx
def get_prime_factors(n):
factors = []
divisor = 2
while divisor <= n:
if n % divisor == 0:
factors.append(divisor)
n = n / divisor
else:
divisor += 1
return factors
number = int(input("Enter a number: "))
prime_factors = get_prime_factors(number)
print("Prime factors of", number, "are:", prime_factors)
xxxxxxxxxx
def findFactors(num: int)->list:
factors=[]
for i in range(1,num+1):
if num%i==0:
factors.append(i)
return factors
xxxxxxxxxx
def Prime_Factorial(n):
if n < 4:
return n
arr = []
while n > 1:
for i in range(2, int(2+n//2)):
if i == (1 + n // 2):
arr.append(n)
n = n // n
if n % i == 0:
arr.append(i)
n = n // i
break
return arr
n = 210
print(Prime_Factorial(n))