Bulk Prime Number Checker
Paste a list of numbers to test all of them simultaneously with 100% accuracy and one-click CSV download.
| # | Number | Result | Smallest Factor | Test Note |
|---|
Carmichael Numbers: Tricky False Primes
A Carmichael number is a composite number that tricks simple power tests into thinking it is prime. Select any Carmichael number below to see how basic tests get fooled and how our engine catches them:
561 factors into 3 × 11 × 17. Our engine catches it in under 0.05ms.
How Our 3-Step Checker Works
To check hundreds of numbers without freezing your screen, every number passes through three fast stages:
Instantly weeds out multiples of 2, 3, 5, 7, and small primes up to 1,000. Eliminates over 85% of non-primes immediately.
Consults an instant in-memory list of the first 10,000 primes for any number up to 104,729.
For larger numbers, tests the 7 special base numbers to give an exact, 100% mathematical proof.
Common School Trap Numbers Table
These numbers frequently trick students on math tests because they look prime at first glance:
| Number | Smallest Factor | Factors | Why It Tricks People |
|---|---|---|---|
| 51 | 3 | 3 × 17 | Ends in 1, but 5 + 1 = 6 (divisible by 3) |
| 57 | 3 | 3 × 19 | Ends in 7, but 5 + 7 = 12 (divisible by 3) |
| 91 | 7 | 7 × 13 | The most famous 2-digit trick composite; divisible by 7 and 13 |
| 119 | 7 | 7 × 17 | Divisible by 7, not prime |
| 561 | 3 | 3 × 11 × 17 | Smallest false prime (Carmichael number) |
Format & Clean Up Your List
Copying from a spreadsheet, database, or programming script? Paste your raw text below to convert it cleanly into the format you need:
Famous Numbers That Trick Simple Tests
The table below lists composite numbers that fool simple divisibility tests. Click any row to test it in the batch checker:
| Number (n) | Prime Factors | Smallest Factor | Simple Power Test | Description |
|---|---|---|---|---|
| 51 | 3 × 17 | 3 | Fails | Sum of digits = 6 (divisible by 3) |
| 57 | 3 × 19 | 3 | Fails | Famous math joke number ("Grothendieck prime") |
| 87 | 3 × 29 | 3 | Fails | 8 + 7 = 15 (multiple of 3) |
| 91 | 7 × 13 | 7 | Fails | Smallest composite ending in 1 not divisible by 2, 3, or 5 |
| 119 | 7 × 17 | 7 | Fails | Common exam trick question |
| 341 | 11 × 31 | 11 | Passes base 2! | Smallest false prime for base 2 |
| 561 | 3 × 11 × 17 | 3 | Passes all bases! | Smallest Carmichael number (fools simple tests) |
| 1,001 | 7 × 11 × 13 | 7 | Fails | 7 × 11 × 13 |
| 1,105 | 5 × 13 × 17 | 5 | Passes all bases! | Second Carmichael number |
| 1,729 | 7 × 13 × 19 | 7 | Passes all bases! | Famous Hardy-Ramanujan Taxicab number |
| 2,821 | 7 × 13 × 31 | 7 | Passes all bases! | Carmichael number with 4 prime factors |
Why Simple Tests Fail & How We Guarantee Accuracy
Checking hundreds of numbers quickly requires both speed and absolute mathematical accuracy. Here is why shortcut tests fail and how we prevent mistakes:
A famous math rule shows that if p is prime, 2^(p-1) minus 1 is always divisible by p. But the reverse is not always true!
Numbers like 341 or 561 mimic primes on simple checks. That is why our engine uses a stronger 7-step test that catches every single one.
Why Our 7-Base Check Never Fails
By checking the 7 proven base numbers (2, 3, 5, 7, 11, 13, and 17), mathematicians proved there are zero false positives for all numbers up to 18 quintillion (2⁶⁴). You get 100% exact math every time.
Step-by-Step Examples
Four examples showing how the batch engine processes different types of input:
Checking [2, 7, 9, 51, 97]
- Splits the list into individual numbers.
- 2: Smallest prime → Prime.
- 7: Small prime → Prime.
- 9: Divisible by 3 → Composite.
- 51: 3 × 17 → Composite.
- 97: Checked up to √97 → Prime.
- Summary: 3 Primes, 2 Composites. Done in under 0.1ms.
Checking 561
- Input: 561.
- Quick check: 5 + 6 + 1 = 12, so 561 divides by 3.
- Instant result: Composite (Factor: 3).
- Even without the quick check, the 7-base engine catches it immediately.
Checking 1,000,000,007
- Checks small primes (2, 3, 5, 7... none divide cleanly).
- Runs the 7-base test.
- All 7 test bases pass with zero remainders.
- Result: Prime (100% Proven).
Checking [0, 1, -7, abc]
- 0 and 1: Neither prime nor composite.
- Negative numbers (-7): Primes must be positive numbers greater than 1.
- Words ('abc'): Marked as invalid text.
- Result: Clearly grouped under "Invalid / 0 and 1".
Speed & Accuracy Comparison
How our 3-step checking system compares to standard testing approaches:
| Method | Time for 500 Numbers | Per Number | Accuracy |
|---|---|---|---|
| Dividing One by One | ~2,400 ms | 4.8 ms | 100% Exact |
| Simple Power Check (Base 2) | ~18 ms | 0.036 ms | Unreliable (Tricked by Carmichael numbers) |
| Our 3-Step Tool | < 8 ms | < 0.016 ms | 100% Proven up to 18 quintillion |
Related Batch & Analysis Tools
Frequently Asked Questions
How many numbers can I check at once?
You can check up to 500 whole numbers at the same time in a single list. The calculations run directly in your browser with instant results and 100% mathematical accuracy.
How should I separate the numbers in my list?
You can paste numbers separated by new lines, commas, semicolons, tabs, or spaces. The tool automatically trims extra spaces and ignores blank lines.
Does this tool catch tricky numbers that look prime (Carmichael numbers)?
Yes! Numbers like 561, 1,105, 1,729, and 2,821 look prime to simple checks, but they are actually composite. Our tool checks 7 proven test bases to guarantee these tricky numbers are correctly flagged as composite.
Can I filter and download the results as a CSV spreadsheet?
Yes. You can filter the results to view Primes Only, Composites Only, or All Numbers, and click the Export button to download a spreadsheet with every number and its smallest factor.
Is there a limit on how large each individual number can be?
Individual numbers up to 18 quintillion (2⁶⁴) are tested with 100% exact math. Decimals, negative numbers, and non-number words are clearly marked as invalid rows.
How does the tool check hundreds of numbers so fast?
Over 80% of composite numbers can be divided by small primes like 2, 3, 5, or 7. The tool tests these tiny factors first in a split second, saving deeper tests only for numbers that might truly be prime.