For Project Euler problems I already needed an iterator that iterates over primes. (Under the hood it uses the sieve of Eratosthenes to calculate blocks of primes and then returns them.)

If you already have that iterator, dividing by the primes up to and including the square root is quite easy.