A prime checker tells you whether a whole number is prime, meaning it has exactly two divisors: 1 and itself. The FindUtils Prime Checker answers that for any whole number from 2 up to 9,007,199,254,740,991, and when the number is not prime it shows the full prime factorization with powers, for example 360 = 2³ × 3² × 5. The result updates as you type, and on the tool page the arithmetic runs in your browser.
This guide walks through the tool, explains how to read a factorization, shows why the method it uses is exact rather than probabilistic, and covers the numbers that trip people up: 1, 2, 561 and the largest integers a browser can hold exactly.
Prime or Composite: the Short Version
Every whole number above 1 is either prime or composite.
| Number | Verdict | Prime factorization | Why it is interesting |
|---|---|---|---|
| 2 | Prime | 2 | The only even prime |
| 97 | Prime | 97 | The largest prime below 100 |
| 360 | Composite | 2³ × 3² × 5 | The tool's starting value; 6 prime factors in total |
| 561 | Composite | 3 × 11 × 17 | The smallest Carmichael number, which fools a simple Fermat test |
| 1001 | Composite | 7 × 11 × 13 | Looks prime at a glance |
| 2,147,483,647 | Prime | 2,147,483,647 | 2³¹ − 1, the largest signed 32-bit integer, proved prime by Euler by 1772 |
| 9,007,199,254,740,991 | Composite | 6361 × 69431 × 20394401 | 2⁵³ − 1, the largest whole number the tool accepts |
Each row above is a real result from the tool's own calculation, checked on 21 October 2026.
How to Use the Prime Checker
Step 1Enter a Whole Number
Open the Prime Checker and type a number into the Number box. It accepts any whole number from 2 upwards. The page opens with 360 already filled in, so you see a worked example straight away.
Step 2Read the Verdict
A green card with a check mark says This number is prime: it has no divisors other than 1 and itself. A grey card with a cross says This number is composite: it can be written as a product of smaller primes.
Step 3Read the Prime Factorization
For a composite number, the Prime factorisation panel writes the number as a product of primes, smallest first. Repeated primes are grouped into powers, so 2 × 2 × 2 × 3 × 3 × 5 is shown as 2³ × 3² × 5. Below it, a line counts the prime factors in total, counting repeats: 360 has 6 (three 2s, two 3s and one 5). A power of 10 or more is written with a caret, so 1024 reads 2^10.
Step 4Fix an Error Message
The tool shows a red message instead of a verdict when the input is not a whole number of at least 2. That covers 0, 1, negative numbers and decimals like 7.5. Numbers above 9,007,199,254,740,991 are rejected too, with a message that the value is outside the safe integer range, rather than given a wrong answer.
How to Read a Prime Factorization
The fundamental theorem of arithmetic says every whole number above 1 can be written as a product of primes in exactly one way, apart from the order of the factors. That uniqueness is what makes the factorization useful: it is a fingerprint of the number.
From the factorization 360 = 2³ × 3² × 5 you can read:
- Every divisor of the number. A divisor uses each prime at most as many times as it appears. Any choice of 2⁰ to 2³, 3⁰ to 3² and 5⁰ to 5¹ gives a divisor, such as 2² × 5 = 20.
- How many divisors there are. Add 1 to each power and multiply: (3 + 1) × (2 + 1) × (1 + 1) = 24 divisors of 360, counting 1 and 360.
- Whether it is a perfect square. A number is a perfect square when every power is even. 360 is not (the powers are 3, 2 and 1); 3600 = 2⁴ × 3² × 5² is.
- The greatest common divisor with another number. Take the primes both numbers share, each at its smaller power. For two numbers, the GCD & LCM Calculator does this directly without factoring.
How the Tool Decides: Trial Division to the Square Root
The tool uses trial division. It divides the number by 2 as many times as it can, then by 3, then by each larger candidate, and records every divisor it finds. It stops as soon as the candidate squared is larger than what is left. Whatever remains above 1 at that point is itself prime and becomes the last factor.
Stopping at the square root is safe for a simple reason. If a number n equals a × b with a ≤ b, then a × a ≤ a × b = n, so a can be at most √n. A composite number always has a divisor no larger than its square root. If no candidate up to √n divides it, the number is prime.
Two consequences matter in practice:
- The answer is exact. Trial division never guesses. A composite number cannot pass it, which is not true of quick probabilistic tests. 561 = 3 × 11 × 17 passes the Fermat test for every base that shares no factor with it, because 2, 10 and 16 all divide 560. Trial division finds the factor 3 on the second try.
- Large primes take the longest. A composite number with a small factor finishes almost instantly, because each factor found shrinks what is left. A large prime forces the tool to try every candidate up to its square root. For 2,147,483,647 that is about 46,000 candidates, which is instant. For 9,007,199,254,740,881, the largest prime the tool accepts, it is about 95 million, which takes a noticeable moment.
The Limit: 9,007,199,254,740,991
Browsers store numbers as 64-bit floating-point values, which hold whole numbers exactly only up to 2⁵³ − 1 = 9,007,199,254,740,991. MDN calls this Number.MAX_SAFE_INTEGER. Above it, two different whole numbers can share the same stored value, so a divisibility test would no longer be reliable. The Prime Checker therefore refuses larger inputs instead of answering about a number you did not type.
Useful landmarks near the limit:
| Number | What it is |
|---|---|
| 9,007,199,254,740,991 | 2⁵³ − 1: composite, 6361 × 69431 × 20394401 |
| 9,007,199,254,740,881 | 2⁵³ − 111: the largest prime the tool can check |
| 1,000,000,007 | A prime that programmers use as a modulus; the tool confirms it at once |
| 600,851,475,143 | Composite: 71 × 839 × 1471 × 6857 |
Common Tasks
Simplify a fraction by hand. Factor the numerator and the denominator and cancel the primes they share. 84/126: 84 = 2² × 3 × 7 and 126 = 2 × 3² × 7, so both divide by 2 × 3 × 7 = 42, leaving 2/3. The Fraction Calculator does the reduction for you and shows the steps.
Check homework. Enter the number and compare the factorization with yours, power by power. The order of the primes does not matter; the tool always lists them smallest first.
Test a "random-looking" number. IDs, hash table sizes and modulus values are often chosen to be prime. Paste the value to confirm it.
See a number in binary or hex. 2,147,483,647 is 7FFFFFFF in hexadecimal and thirty-one 1s in binary. The Number Base Converter shows the same value in any base.
Common Mistakes to Avoid
Mistake 1: Calling 1 a Prime
1 has only one divisor, itself, so it is not prime and not composite. Leaving it out is also what keeps prime factorizations unique; otherwise you could add any number of 1s. The tool starts at 2 for this reason.
Mistake 2: Assuming Odd Numbers Are Prime
Many odd numbers are composite: 9, 15, 21, 91 (7 × 13) and 1001 (7 × 11 × 13). Only 2 is an even prime, but being odd proves nothing.
Mistake 3: Stopping at Small Factors
Checking 2, 3, 5 and 7 is not enough for larger numbers. 221 = 13 × 17 has no factor below 13. You must test every candidate up to the square root; 221 needs candidates up to 14.
Mistake 4: Trusting Results Past 2⁵³ in Other Tools
Calculators that accept any length of input but store numbers as floating point can quietly round a 17-digit number before testing it. If a tool reports a verdict for a number above 9,007,199,254,740,991, check whether it uses exact big-integer arithmetic.
Mistake 5: Treating a Fast "Probably Prime" as Proof
Fermat-style tests can say "probably prime" for composites like 561. Trial division, which the Prime Checker uses, gives a proof either way.
FAQ
How do I check if a number is prime?
Enter it in the Prime Checker. The tool tries every possible divisor up to the number's square root and tells you whether it is prime. If it is not, you also get the full prime factorization.
Is 1 a prime number?
No. A prime has exactly two divisors, 1 and itself, and 1 has only one. That is why the Prime Checker accepts numbers from 2 upwards.
What is the prime factorization of 360?
360 = 2³ × 3² × 5, which is 2 × 2 × 2 × 3 × 3 × 5. That is 6 prime factors in total, and the tool shows exactly this when you open it.
Why does the tool only check up to the square root?
If a number has a divisor larger than its square root, the matching divisor is smaller than the square root. So a composite number always has a factor no larger than √n, and finding none proves the number is prime.
What is the largest number the Prime Checker can test?
9,007,199,254,740,991 (2⁵³ − 1), the largest whole number a browser stores exactly. The largest prime below that limit is 9,007,199,254,740,881.
Is 2,147,483,647 prime?
Yes. It is 2³¹ − 1, a Mersenne prime that Euler proved prime by 1772, and it is also the largest value of a signed 32-bit integer.
Is the Prime Checker free?
Yes. It is free, needs no account, and on the tool page the calculation runs in your browser.
Next Steps
- Find common factors and multiples of two numbers with the GCD & LCM Calculator, or read GCD and LCM explained.
- Reduce and combine fractions with the Fraction Calculator.
- Convert numbers between binary, octal, decimal and hex with the Number Base Converter guide.
- See why 2,147,483,647 also limits 32-bit timestamps in Unix timestamps: seconds vs milliseconds.
