User blog comment:Nedherman1/The Perfect Prime Number/@comment-35470197-20190203222852

Since such a prime \(p\) should be congruent to \(1\) or \(13\) modulo \(36\), it is not so difficult (but very tiresome) to verify whether there is another smaller one or not. Although I do not whether there are infinitely many such primes or not, if exist, then the sequence of such ones forms a large function faster than the sequence of prime numbers. Therefore this topic is actually related to large numbers.