# Python and the equivalent of perl's bigint package???

Is there a python module that's is equivalent to perl's bigint package? i have greatly inproved the preformance of my perfect number program, "perfetNumberGen 5.py". this version will find the first seven perect numbers, the old vers "perfectNumber 3.py" would only find the first four perfect numbers. I have a perl version of "perfetNumberGen 5" that uses perl's bigint package and finds the first eight perfect numbers in 24 seconds of CPU time on my old G4 powerbook running MacOSX 10.4.11. The python version dies of a malloc error when checking if the 2**29 - 1 is merenne number is prime. It is not and the 31th merenne number is prime and generates the 8th perfect number. I run out of time on SoloLearn's code playground. Is there an almost infinite precision integer arithmetic module for python Note: the nth merenne number is mn(n) = (2**n)-1. If mn(n) is prime then pn(n) = mn(n)*2**(n-1) is a perfect number,