The pseudocode for finding the prime factors of an integer – Step 1: TAKE INPUT from the user  Step 2: ITERATE from 3 to square root of the number  Step 3: CHECK IF the number is divisible by the iterator. If yes, then display the number.  Step 4: DISPLAY the final indivisible value.  The python program for the same is –  # Take input from user
num = int(input("Enter a number: "))
for i in range(2, int(num**0.5)):
while num % i == 0:
print(i, end = " ")
num //= i
print(num) The output of the program is –  Enter a number: 153  3 3 17