This number is a prime.

+ The square of this prime is the smallest composite number such that all ways of concatenating its divisors are prime. Can you estimate how much computer processing is required to find a number that is neither a prime nor the square of one that satisfies this criterion? [Merickel]

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