In normal RSA we have $n = pq $ with $p$ and $q$ being prime numbers
Suppose now we have $n = r^2 pq t $ with $r,p,q,t$ being prime.
Is it possible to factorize with the $r^2$ more easily?
For example what would be the upper bound for testing
$gcd(r^2,n)$ , for all $r$ between 2 and the upper bound?