faster way of computing large numbers java
I was looking at the wikipedia page on [primes][1] and of course, I came across the largest prime which is 	2^43,112,609 − 1. This number is exceptionally large, so for fun, I decided to put this into `BigInteger`. To calculate this, it would take a very long time (I gave up after a while). Is there any faster of computing a very large number like this? or is BigInteger and a better computer the only way? Any reduction of time would be great. 

  [1]: http://en.wikipedia.org/wiki/Prime_number
faster way of computing large numbers java
===

I was looking at the wikipedia page on [primes][1] and of course, I came across the largest prime which is 	2^43,112,609 − 1. This number is exceptionally large, so for fun, I decided to put this into `BigInteger`. To calculate this, it would take a very long time (I gave up after a while). Is there any faster of computing a very large number like this? or is BigInteger and a better computer the only way? Any reduction of time would be great. 

  [1]: http://en.wikipedia.org/wiki/Prime_number