def sieve_factor(num):
t3 = time.time()
s = prime_tools.sieve(int(math.sqrt(num)) + 1)
primes = [p for p in s.keys() if s[p]]
prime_factors = []
for prime in primes:
if num % prime == 0:
prime_factors.append(prime)
return prime_factors
def sieve_sum_primes():
s = prime_tools.sieve(2000001)
return sum(x for x in s.keys() if s[x])
