Prime Families Checker

Special Prime Checker

Find out which special families your prime belongs to: Sophie Germain, Safe, Palindrome, Emirp, Circular, and Fibonacci primes.

Quick Examples:
Prime Classification 13 is Prime
Belongs to 2 Special Prime Families
01

Sophie Germain & Safe Prime Pair Explorer

A prime number p is a Sophie Germain prime if 2p + 1 is also a prime number. In that partner relationship, the larger number is called a Safe prime. Enter any prime below to test this pair:

Quick Pairs:
Starter Prime (p) p = 11
Formula 2p + 1 2(11) + 1 = 23
Safe Partner q q = 23 (Prime!)
Digital Security Safe for Encryption!
11 is a confirmed Sophie Germain prime, and 23 is its Safe prime partner!
02

Emirp Prime Reverser (13 ↔ 31)

An emirp prime (“prime” spelled backwards) is a prime that turns into a different prime when you reverse its digits. Palindromes like 131 don't count because their reverse is identical! Select a pair below:

Forward Number: 13 (Prime)
Reversed Digits: 31 (Different Prime!)
Status: Genuine Emirp Prime! Both directions form distinct prime numbers.
03

Famous Special Primes Reference Table

Click any landmark prime below to see all the special families it belongs to:

Prime p Special Families Why It Is Famous Action
2
Even PrimeSophie Germain (→ 5)Circular
The only even prime number in mathematics
3
Fermat F₀Fibonacci F₄Sophie Germain (→ 7)Twin Prime
Smallest odd prime
5
Fermat F₁Fibonacci F₅Safe (from 2)Sophie Germain (→ 11)
Connects to 5-sided pentagons
7
Safe (from 3)Mersenne M₃Circular
First prime where 2p+1=15 is composite
11
PalindromeSophie Germain (→ 23)Circular
The ONLY even-length palindrome prime!
13
Emirp (↔ 31)Fibonacci F₇Circular
First two-digit emirp prime
17
Fermat F₂Twin Prime
Famous 17-sided polygon discovery by Gauss
23
Safe (from 11)Sophie Germain (→ 47)
Both a Safe and Sophie Germain prime
31
Mersenne M₅Emirp (↔ 13)Circular
Reverses to 13; also a Mersenne prime
37
Emirp (↔ 73)Circular
Reverses to 73
41
Sophie Germain (→ 83)Twin Prime
Starts Euler streak x² + x + 41
47
Safe (from 23)
Safe prime partner to 23
71
Emirp (↔ 17)Twin Prime (71, 73)
Twin prime and reversible emirp
73
Emirp (↔ 37)CircularSheldon Prime
21st prime; 73 in binary is palindrome 1001001
79
Emirp (↔ 97)Circular
Reverses to 97
83
Safe (from 41)Sophie Germain (→ 167)
Part of a 3-prime chain
89
Fibonacci F₁₁Sophie Germain (→ 179)
11th Fibonacci number is prime
97
Emirp (↔ 79)Circular
Only prime in the 90s
131
Palindrome Prime
3-digit palindrome; not an emirp
197
Circular Prime
Rotations 197, 971, 719 are all prime
04

Circular Prime Carousel Simulator

A circular prime stays prime through every cyclic rotation of its digits like a carousel. Test numbers below to watch the digits cycle:

Inspect:

Key Property: Any circular prime with 2 or more digits can ONLY contain digits 1, 3, 7, and 9. If it contained 0, 2, 4, 5, 6, or 8, rotating that digit to the end would create an even number or a multiple of 5!

05

Step-by-Step Worked Walkthroughs

Here are four examples showing how special prime properties are tested:

Walkthrough 1

Testing Prime 11

Sophie Germain Check: 2(11) + 1 = 23. 23 is prime → 11 is a Sophie Germain prime!
Safe Prime Check: (11 - 1)/2 = 5. 5 is prime → 11 is also a Safe prime!
Palindrome Check: 11 reads identical backwards → Palindrome prime.
Emirp Check: Because reverse equals forward, 11 is NOT an emirp.
Result: Member of 3 distinct prime families.

Walkthrough 2

Testing Prime 13

Emirp Check: Reverse digits of 13 to get 31. 31 is prime and different from 13 → Genuine Emirp prime!
Fibonacci Check: Appears in the Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13...) → Fibonacci prime.
Circular Check: Rotations are 13 and 31; both are prime → Circular prime.
Sophie Germain Check: 2(13) + 1 = 27 = 3 × 9 (composite) → Not Sophie Germain.

Walkthrough 3

Why 1,221 Is Not Prime (Even Palindrome Rule)

Number of Digits: 1,221 has 4 digits (an even count).
Divisibility by 11: Any palindrome with an even number of digits is always a multiple of 11.
Division: 1,221 = 11 × 111 = 11 × 3 × 37.
Result: Always composite! (Only 11 itself escapes this rule).

Walkthrough 4

Circular Prime Digit Rule

Rule: Multi-digit circular primes can NEVER contain 0, 2, 4, 5, 6, or 8.
Why: If you rotate the digits, that even digit or 5 will eventually end up in the last spot.
For example, 23 rotates to 32 (an even number!). 53 rotates to 35 (ends in 5!).
Therefore, circular primes can only contain the digits 1, 3, 7, and 9.

06

How Computers Check Each Prime Family

Each special family requires a different test to confirm membership:

Prime Family What Gets Tested Test Speed How It Works
Sophie Germain Test Is 2p + 1 prime? Microsecond Quick primality test on 2p + 1
Safe Prime Test Is (p - 1)/2 prime? Microsecond Quick primality test on half minus one
Emirp & Palindrome Test Reverses digits as text Instant Flips digit order and tests the reversed number
Circular Prime Test Cycles digits like a carousel Fast Checks all cyclic digit rotations for primality
Fibonacci Prime Test Tests if 5p² ± 4 is a square Instant Square root formula test for Fibonacci membership

Related Prime Discovery Tools

Frequently Asked Questions

What is a Sophie Germain prime?

A prime number p is a Sophie Germain prime if 2p + 1 is also a prime number. For example, 11 is a Sophie Germain prime because 2(11) + 1 = 23, and 23 is prime! Named after French mathematician Sophie Germain, these primes are crucial in computer security.

What is a Safe prime?

A prime number q is a Safe prime if (q - 1) / 2 is also prime. In other words, if p is a Sophie Germain prime, then 2p + 1 is a Safe prime! They are called 'safe' because they make digital encryption keys much harder for hackers to crack.

What is the difference between a Palindrome prime and an Emirp prime?

A Palindrome prime reads exactly the same forwards and backwards (like 131 or 929). An Emirp prime ('prime' spelled backwards) is a prime that turns into a DIFFERENT prime when you reverse its digits (like 13 → 31 or 17 → 71). Palindromes don't count as emirps because reversing them doesn't create a new number.

What is a Circular prime?

A Circular prime is a prime number that stays prime no matter how you cycle its digits like a carousel. For example, 197 is a circular prime because 197, 971, and 719 are all prime numbers!

Why are there no palindrome primes with an even number of digits (except 11)?

Because of a simple math rule: any palindrome with an even number of digits (like 1,221 or 33,553) is always divisible by 11. Since 11 divides all of them, none of them can be prime except 11 itself!

What are Fermat primes?

Fermat primes are numbers shaped like 2^(2^n) + 1. Mathematician Pierre de Fermat guessed that every number in this pattern was prime (giving 3, 5, 17, 257, and 65,537). But in 1732, Leonhard Euler proved the very next one (4,294,967,297) is composite (641 × 6,700,417), breaking Fermat's guess.

What is a Fibonacci prime?

A Fibonacci prime is a prime number that also appears in the famous Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89...). Common examples include 2, 3, 5, 13, and 89.

What is a Cunningham chain?

A Cunningham chain is a chain of primes where each number is double the previous one plus one: p, 2p + 1, 2(2p + 1) + 1, and so on. For example, 2 → 5 → 11 → 23 → 47 is a chain of 5 primes in a row!