Prime Number Checker — Is It Prime? Trial Division & Factorization

A prime number has exactly two divisors: 1 and itself. That sounds simple, but figuring out whether a large number like 104,729 is prime by hand is tedious — which is why a fast checker is genuinely useful. Use the CalcHub Prime Number Checker to test any integer in seconds.

How the Trial Division Method Works

The most straightforward primality test: divide the number n by every integer from 2 up to √n. If none of them divide evenly, the number is prime.

Why only up to √n? If n has a factor larger than √n, then the corresponding paired factor must be smaller than √n — so we'd have already found it. Algorithm in plain English:

1. If n < 2, not prime.
2. If n = 2 or n = 3, prime.
3. If n is even or divisible by 3, not prime.
4. Test divisors of the form 6k ± 1 up to √n.

Example — is 97 prime? √97 ≈ 9.85, so test 2, 3, 5, 7. 97 ÷ 2 = 48.5 | 97 ÷ 3 = 32.3 | 97 ÷ 5 = 19.4 | 97 ÷ 7 = 13.9 No whole number results → 97 is prime. Example — is 91 prime? 91 ÷ 7 = 13 exactly → 91 is not prime (it equals 7 × 13).

Prime Factorization

Every composite (non-prime) number breaks down into a unique product of primes — this is the Fundamental Theorem of Arithmetic.

Factorize 360:

• 360 ÷ 2 = 180
• 180 ÷ 2 = 90
• 90 ÷ 2 = 45
• 45 ÷ 3 = 15
• 15 ÷ 3 = 5
• 5 is prime

Result: 360 = 2³ × 3² × 5

First 100 Prime Numbers

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
283	293	307	311	313	317	331	337	347	349
353	359	367	373	379	383	389	397	401	409
419	421	431	433	439	443	449	457	461	463
467	479	487	491	499	503	509	521	523	541

The 100th prime is 541.

Why Primes Matter

• RSA encryption relies on the difficulty of factoring a product of two very large primes. Your HTTPS connection right now depends on this.
• Hash tables use prime-sized arrays to reduce collisions.
• Cicadas emerge every 13 or 17 years (both prime) to minimize overlap with predator cycles — nature's number theory.

Special Cases Worth Knowing

Number	Status	Reason
1	Not prime	Only one divisor
2	Prime	Only even prime
0, negative	Not prime	Definition requires n ≥ 2
4, 6, 8, 9	Composite	Have factors besides 1 and themselves

Is 1 a prime number?

No. By modern convention, 1 is neither prime nor composite. The definition of prime requires exactly two distinct divisors (1 and itself), and 1 only has one divisor.

What's the largest known prime?

As of early 2026, the largest known prime is a Mersenne prime with over 41 million digits, discovered through the Great Internet Mersenne Prime Search (GIMPS). Trial division doesn't work for numbers that big — specialized probabilistic tests like Miller-Rabin are used instead.

Can negative numbers be prime?

In standard integer arithmetic, no. Primality is defined only for positive integers greater than 1. In abstract algebra, negative primes exist in different ring structures, but that's well outside everyday math.

Related Calculators

• GCD & LCM Calculator — uses prime factorization under the hood
• Exponent Calculator
• Fraction Calculator