This number is a prime.

+ The smallest odd prime of the form (2^n+n^2) == 0 mod (n+2). [Post]

+ The smallest prime-digit emirp that remains an emirp when each digit is replaced by its binary representation: 111011111111. [Beedassy]

(There is one curio for this number that has not yet been approved by an editor.)

Printed from the PrimePages <primes.utm.edu> © G. L. Honaker and Chris K. Caldwell