Permutable prime
| No. of known terms | 20 |
|---|---|
| Conjectured no. of terms | Infinite |
| First terms | 2, 3, 5, 7, 11, 13, 17, 37, 79, 113, 199 |
| Largest known term | (10270343-1)/9 |
| OEIS index | A258706 |
A permutable prime, also known as anagrammatic prime, is a prime number which, in a given base, can have its digits' positions switched through any permutation and still be a prime number. H. E. Richert, who is supposed to be the first to study these primes, called them permutable primes, but later they were also called absolute primes.
In base 10, all the permutable primes with fewer than 49,081 digits are known
Of the above, there are 16 unique permutation sets, with smallest elements
Note Rn = is a repunit, a number consisting only of n ones (in base 10). Any repunit prime is a permutable prime with the above definition, but some definitions require at least two distinct digits.
All permutable primes of two or more digits are composed from the digits 1, 3, 7, 9, because no prime number except 2 is even, and no prime number besides 5 is divisible by 5. It is proven that no permutable prime exists which contains three different of the four digits 1, 3, 7, 9, as well as that there exists no permutable prime composed of two or more of each of two digits selected from 1, 3, 7, 9.
There is no n-digit permutable prime for 3 < n < 6·10175 which is not a repunit. It is conjectured that there are no non-repunit permutable primes other than those listed above.
In base 2, only repunits can be permutable primes, because any 0 permuted to the ones place results in an even number. Therefore, the base 2 permutable primes are the Mersenne primes. The generalization can safely be made that for any positional number system, permutable primes with more than one digit can only have digits that are coprime with the radix of the number system. One-digit primes, meaning any prime below the radix, are always trivially permutable.
...
Wikipedia