You can move on to other tests already all of the factors your methods could find have already been found for exponents below 4 billion or so.
You haven't the slightest idea of the mathematics of mersenne factors, nor how to program so you're writing really slow code that does really slow algorithms to factor.
If you want fast factors of mersennes, use factor5, or Prime95. Or, read the most basic properties of mersenne factors.
Your first statement isn't even true not every factor of 2^p1 is prime. Some are composite, really.
