Project Euler 675 - 2^ω(n)

Official link: https://projecteuler.net/problem=675

Note: My code runs in ~130 seconds (brought down to 55s with pypy), but my sieve is quick and my understanding is good so I'm happy with this problem!