A code snippet to pick the set of divisor from a number, with or without limit the largest possible value. Enjoy, if useful.

Set of Divisors

import numpy as np

def pick_divisors(value, max_divisor=None):
    divisors = []
    calc_value = np.int0(np.sqrt(value))
    limit = calc_value if max_divisor is None else min(max_divisor, calc_value)
    for i in range(1, limit):
        if value % i == 0:
            divisors.append(i)
            
    return divisors
    
print(pick_divisors(1000, 100))
print(pick_divisors(129030198, 2000))
print(pick_divisors(1349586))