This is a BSITD (swag),

but

Do you mean, pick a large group of primes/prp's near the root of the RSA number, and pair them up so the product of the first 5 digits matches the RSA, and the same for the last 5?

If RSA = 18124... ...32589 and first candidate

factor = 34209... ...74208 then look for a second candidate

factor = 52983... ...44023.

If you don't find a match, the first can't be a factor.

hmm, if there was a way to determine a narrow boundry to keep the search fast, it might be worth the time.