Dihedral prime

A dihedral prime or dihedral calculator prime is a prime number that still reads like itself or another prime number when read in a seven-segment display, regardless of orientation (normally or upside down), and surface (actual display or reflection on a mirror). The first few decimal dihedral primes are

5, 11, 101, 181, 1181, 1811, 18181, 108881, 110881, 118081, 120121, 121021, 121151, 150151, 151051, 151121, 180181, 180811, 181081 (sequence A134996 in the OEIS

).

The smallest dihedral prime that reads differently with each orientation and surface combination is 120121 which becomes 121021 (upside down), 151051 (mirrored), and 150151 (both upside down and mirrored).

The digits 0, 1 and 8 remain the same regardless of orientation or surface (the fact that 1 moves from the right to the left of the seven-segment cell when reversed is ignored). 2 and 5 remain the same when viewed upside down, and turn into each other when reflected in a mirror. In the display of a calculator that can handle

U.S. dollar bills

, 5 reflects to a 7 when reflected in a mirror, while 2 resembles a 7 upside down.)

binary

, all palindromic primes are dihedral). It appears to be unknown whether there exist infinitely many dihedral primes, but this would follow from the conjecture that there are infinitely many repunit primes.

The palindromic prime 10¹⁸⁰⁰⁵⁴ + 8×(10⁵⁸⁵⁶⁷−1)/9×10⁶⁰⁷⁴⁴ + 1, discovered in 2009 by Darren Bedwell, is 180,055 digits long and may be the largest known dihedral prime as of 2009^[update].^[1]

Notes

^ Chris Caldwell, The Top Twenty: Palindrome. Retrieved on 2009-09-16

References

Mike Keith. "Puzzle 39.- The Mirrorable Numbers". The prime puzzles & problems connection.

Eric W. Weisstein. "Dihedral Prime". MathWorld – A Wolfram Web Resource.

[1] Chris Caldwell, The Top Twenty: Palindrome. Retrieved on 2009-09-16

[1]

v t e Prime number classes
By formula	Fermat ( $2 2 n + 1$ ) Mersenne ( $2 p - 1$ ) Double Mersenne ( $2 2 p -1 - 1$ ) Wagstaff $(2 p + 1)/3$ Proth ( $k \cdot2 n + 1$ ) Factorial ( $n! \pm 1$ ) Primorial ( $p n # \pm 1$ ) Euclid ( $p n # + 1$ ) Pythagorean ( $4 n + 1$ ) Pierpont ( $2 m \cdot3 n + 1$ ) Quartan ( $x 4 + y 4$ ) Solinas ( $2 m \pm 2 n \pm 1$ ) Cullen ( $n \cdot2 n + 1$ ) Woodall ( $n \cdot2 n - 1$ ) Cuban ( $x 3 - y 3)/(x - y$ ) Leyland ( $x y + y x$ ) Thabit ( $3\cdot2 n - 1$ ) Williams ( $(b -1)\cdot b n - 1$ ) Mills ( $⌊ A 3 n ⌋$ )
By integer sequence	Fibonacci Lucas Pell Newman–Shanks–Williams Perrin
By property	Wieferich (pair) Wall–Sun–Sun Wolstenholme Wilson Lucky Fortunate Ramanujan Pillai Regular Strong Stern Supersingular (elliptic curve) Supersingular (moonshine theory) Good Super Higgs Highly cototient Unique
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Delicate Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n \pm 1, 2 n \pm 1, 4 n \pm 1, \dots$ ) Triplet ( $p, p + 2 or p + 4, p + 6$ ) Quadruplet ( $p, p + 2, p + 6, p + 8$ ) k-tuple Cousin ( $p, p + 4$ ) Sexy ( $p, p + 6$ ) Chen Sophie Germain/Safe ( $p, 2 p + 1$ ) Cunningham ( $p, 2 p \pm 1, 4 p \pm 3, 8 p \pm 7, ...$ ) Arithmetic progression ( $p + a\cdotn, n = 0, 1, 2, 3, ...$ ) Balanced ( $consecutive p - n, p, p + n$ )
By size	Mega (1,000,000+ digits) Largest known list
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Perrin Somer–Lucas Strong Carmichael number Almost prime Semiprime Sphenic number Interprime Pernicious
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 60 primes	2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
List of prime numbers

See also

Notes

References