Prime Number Checker
One entry per line - check primality, list primes in a range, or find the Nth prime
Mode:
Max results:
Separator:
Calculation Result
Download CSV
| No. | Value | Result | Detail |
|---|
Introduction to the tool and how to use it
Prime checker and generator: one input box handles three common needs, one entry per line, many lines at once.
Composite numbers show their smallest prime factor (for example 360 = 2 × 180), while primes are marked yes. Large integers use BigInt plus Miller-Rabin (deterministic below 2^64), so no floating-point error; range mode uses the Sieve of Eratosthenes and returns instantly up to 5 000 000.
Composite numbers show their smallest prime factor (for example 360 = 2 × 180), while primes are marked yes. Large integers use BigInt plus Miller-Rabin (deterministic below 2^64), so no floating-point error; range mode uses the Sieve of Eratosthenes and returns instantly up to 5 000 000.
How to use
- Choose a mode:
· Check primality: one integer per line, such as97;
· Generate a prime list: one range per line, such as100,200;
· Nth prime: one index per line, such as1000. - Click start calculation; the result table shows the verdict, prime count, or the Nth prime.
- Results can be copied with one click and exported as CSV.
Prime test
Is 97 a prime number?
97 is a prime number, divisible only by 1 and itself.
- Prime?Yes
- Divisors2
- Factors1, 97
- Previous prime89
- Next prime101
Divisor list
| # | Divisor |
|---|---|
| 1 | 1 |
| 2 | 97 |
- Large numbers are decided with Miller-Rabin (12 bases), which is deterministic below 2^64.
Common inputs
Message board
All messages →-
No one has spoken up yet — want to go first?