Зная простые делители числа и их количество, найти все делители числа

n = int(input())
n1 = n
s = {}
for i in range(2, int(n1 ** 0.5) + 1):
    while n % i == 0:
        if i not in s:
            s[i] = 1
        else:
            s[i] += 1
        n //= i
    if n == 1:
        break
print(s)

>>> from itertools import accumulate
>>> def f(lst):
    out = []
    while True:
        if not lst: return set(out)
        out += list(accumulate(lst,lambda a,b: a*b))
        lst = lst[1:]
 
        
>>> f([2,2,5])
{2, 4, 5, 10, 20}

>>> x = 20
>>> [i for i in range(2,x+1) if not x%i]
[2, 4, 5, 10, 20]

from itertools import permutations
from functools import reduce
 
num = 20
subs = {2: 2, 5: 1}
 
 
def main(num, subs):
    just_subs = []
    for sub in subs:
        repeats = subs[sub]
        for repeat in range(repeats):
            just_subs.append(sub)
 
    all_variants =[list(i) for i in permutations(just_subs)]
    res = set()
    while all_variants[0]:
        for var in all_variants:
            res.add(reduce((lambda a, x: a * x), var))
            var.pop()
    return res
 
 
print(main(num, subs))

print(f([2, 3, 5]))  # [2, 3, 5, 6, 15, 30]
Вместо [2, 3, 5, 6, 10, 15, 30]

d = {2: 3, 3: 2, 5: 1}
res = [1]
for p, k in d.items():
  res = [a*p**i for a in res for i in range(k+1)]
print(sorted(res))

d = {2: 3, 3: 2, 5: 1}
s = 1
for p, k in d.items():
  s *= (p**(k+1) - 1) // (p - 1)