def find_largest_prime_factor(number):
    """Returns largest prime factor of `number`

    Args:
        number (int) : The number to be factorised

    Returns:
        number (int) : The largest prime factor of `number`
    """
    i = 2
    while i * i < number:
        while number % i == 0:
            number = number / i
        i += 1
    return number