Is there a prime number greater than googolplex?

Answer 1

I dont know?

Ans 2.

Well, Euclid knew, 2,000 years ago. He proved that whatever number you choose there is always a prime bigger than that number. Here's his proof, modified to deal with googolplex.

Make a list of all the primes that are smaller than googolplex. Multiply them all together, then add one. It's a big number - let's call it BIGNO.
Take any prime from the list and divide it into BIGNO. There will always be a remainder of one. No prime from the list divides BIGNO. That means that BIGNO is either prime, or is the product of two or more primes greater than googolplex. Either way there is a prime greater than googolplex.