// If 2**n-1 is prime, then (2**n-1) * 2**(n-1) is perfect.constMPZ = require('../');
for (let n = 0; n < 100; n++) {
const p = MPZ(2).pow(n).sub(1);
if (p.probPrime(50)) {
const perfect = p.mul(MPZ(2).pow(n - 1));
console.log(perfect.toString());
}
}