Finding the largest prime factor of a number.

I have written a simple code snippet to find the largest prime factor of any given number but I find that it's a bit slow for larger numbers and I'm not sure why. <br>Here is the code:<br>```python<br>import math<br><br>def find_prime_factors(origin):<br> primes = []<br> for number in range(2, origin + 1):<br> if is_prime(number):<br> if origin % number == 0:<br> primes.append(number)<br> return primes<br><br><br>def is_prime(number):<br> prime = True<br> if number < 2:<br> return False<br> for num in range(2, int(math.sqrt(number)) + 1):<br> if number % num == 0:<br> return False<br> return prime<br><br><br>def largest_prime_factor(number):<br> prime = find_prime_factors(number)<br> return max(prime)<br><br><br>def main():<br> number = int(input("Enter a number"))<br> print(f"The largest prime factor of {number} is {largest_prime_factor(number)}")<br><br><br>if __name__ == "__main__":<br> main()<br>```<br>I call `largest_prime_factor(number)` on the number 600,851,475,143,311,069,100,421,987,981,050,300,086,402,000,150,230,300,086,402 and it takes forever to run.