I was thinking about why factorizing RSA numbers is so hard. When humans perform any kind of maths manually, they often employ various 'tricks' that get them closer to the answer. Some are based on mathematical facts, others are just instinctive approximations (such as square roots).
Don't such 'tricks' exist for factorization of a product of 2 large primes. For example, the first thing to do would be to figure out the possible last digits of the answer. We stick to decimal numbers, but a computer could do this in a number system of any base (even 999). Based on previous numbers, can an algorithm be written to 'predict' the factorization based on the individual digits in various number systems.
No, it most likely doesn't, as stated by others in comments.