Emirp

Template:Short description An emirp (pronounced Template:IPAc-en or Template:IPAc-en, an anadrome of prime) is a prime number that results in a different prime when its decimal digits (digits in base 10) are reversed. This definition excludes the related palindromic primes. The term reversible prime is used to mean the same as emirp, but may also, ambiguously, include the palindromic primes.

The first few emirps are

13, 17, 31, 37, 71, 73, 79, 97, 107, 113, 149, 157, 167, 179, 199, ... Template:OEIS.

The first few reversible primes are

2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 101, 107, ... Template:OEIS.

The difference in all pairs of emirps is always a multiple of 18. This follows from all primes bigger than 2 being odd (making their differences even, i.e. multiples of 2) and from differences between pairs of natural numbers with reversed digits being multiples of 9 (which itself is a consequence of $10^n-1$ being a multiple of 9 for every non-negative integer $n$).

All non-palindromic permutable primes are emirps.

It is not known whether there are infinitely many emirps. The largest known emirp as of April 19, 2026 is Template:Nowrap by Ryan Propper and Serge Batalov. The integer's reverse is Template:Nowrap.

History

The term "emirp" was coined by American mathematician Jeremiah Farrell.

Count of emirps

The following table shows the number of n-digit emirps and reversible primes: (sequences Template:OEIS link and Template:OEIS link in the OEIS)

n	Count of n-digit emirps	Count of n-digit reversible primes
1	0	4
2	8	9
3	28	43
4	204	204
5	1406	1499
6	9538	9538
7	70474	71142
8	535578	535578
9	4192024	4197196
10	33619380	33619380
11	274890230	274932272
12	2294771254	2294771254
13	19489532362	19489886063
14	167630912672	167630912672
15	1456473362820	1456476399463

The number of n-digit reversible primes is equal to the number of n-digit emirps plus the number of n-digit palindromic primes.

Largest known emirps

The following table shows the largest known emirps throughout the years:

Number	Reverse	Digits	Date found	Discoverer
101708 + 2047101 × 10851 + 1	101708 + 1017402 × 10851 + 1	1709	1997	H. Dubner
7894807 × 101993 + 1	101999 + 7084987	2000	June 2001	Carlos Rivera
103929 - 571624798 × 101960 - 1	103929 - 897426175 × 101960 - 1	3929	June 2003	J. K. Andersen
1010006 + 941992101 × 104999 + 1	1010006 + 101299149 × 104999 + 1	10007	October 2007	J. K. Andersen
3867632931 × 1010001 + 1	1010010 + 1392367683	10011	February 16, 2026	Stephan Schöler
989263739 × 1015298 + 111258179	971852111 × 1015298 + 937362989	15307	March 17, 2026	Simon Cavegn
1020000 + 518406362 × 109996 + 1	1020000 + 263604815 × 109996 + 1	20001	March 19, 2026	Unknown
1047253 - 22 × 1021607 - 1	1047253 - 22 × 1025644 - 1	47253	March 27, 2026	Serge Batalov
1077763 - 4 × 1025683 - 1	1077763 - 4 × 1052079 - 1	77763	April 6, 2026	Ryan Propper and Serge Batalov
10111956 - 7 × 1053855 - 1	10111956 - 7 × 1058100 - 1	111956	April 19, 2026	Ryan Propper and Serge Batalov

Other bases

Emirps also exist for bases other than 10. For example, 10111₂ = 23 is an emirp in the binary numeral system because 23 is a prime and its reverse 11101₂ = 29 is also a prime.

The first few binary emirps are

11, 13, 23, 29, 37, 41, 43, 47, 53, 61, 67, 71, 83, 97, 101, ... Template:OEIS.

Dartyge et al. (2023) have shown that, in big-O notation, the number of n-digit reversible primes in binary is $O\left(\frac{2^n}{n^2}\right)$.

They also conjecture that the number of n-digit reversible primes in binary is $(3+o(1))\frac{2^{n-1}}{(\log 2^n{)}^2}$ as n goes large.

Emirpimes

The term emirpimes (singular) is used also in places to treat semiprimes in a similar way. That is, an emirpimes is a semiprime that is also a (distinct) semiprime upon reversing its digits.

The first few emirpimeses are

15, 26, 39, 49, 51, 58, 62, 85, 93, 94, 115, 122, 123, ... Template:OEIS.