Algebra
Prime Numbers: List, How To Check Them And Fun Facts
Last updated: October 2026
A prime number is a whole number greater than 1 that can only be divided evenly by 1 and itself. The first prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23 and 29. A number with more than two factors, like 6 (1, 2, 3, 6), is called composite.
There are 25 primes between 1 and 100, and infinitely many beyond that. Below you will find the full list, a quick method to test any number, and the most surprising facts about primes.
What Is A Prime Number?
A prime number has exactly two factors: 1 and the number itself. A factor is a whole number that divides into another with no remainder.
Compare 7 and 8:
| Number | Factors | How many factors | Type |
|---|---|---|---|
| 7 | 1, 7 | 2 | Prime |
| 8 | 1, 2, 4, 8 | 4 | Composite |
| 13 | 1, 13 | 2 | Prime |
| 15 | 1, 3, 5, 15 | 4 | Composite |
Another way to picture it: try to arrange a prime number of objects into a rectangle. Seven coins can only sit in one row of 7. Eight coins can form 2 rows of 4. Primes refuse to make any rectangle except a single line.
Why 1 Is Not A Prime Number
The number 1 is not prime because it has only one factor: itself. A prime needs exactly two different factors.
There is also a deeper reason. Every whole number above 1 can be broken into primes in only one way, such as 12 = 2 × 2 × 3. If 1 counted as prime, you could add as many 1s as you like (12 = 1 × 1 × 2 × 2 × 3), and that one-way rule would fall apart. Leaving 1 out keeps the math clean.
Why 2 Is The Only Even Prime
The number 2 is the smallest prime and the only even one. Every other even number can be divided by 2, which gives it at least three factors: 1, 2 and itself.
So 4, 6, 8, 10 and every even number after them are composite. That means all primes after 2 are odd. But not all odd numbers are prime: 9, 15, 21 and 25 are odd and composite.
Prime Vs Composite Numbers
Every whole number greater than 1 is either prime or composite. A composite number has more than two factors, so it can be made by multiplying two smaller whole numbers.
| Prime numbers | Composite numbers | |
|---|---|---|
| Number of factors | Exactly 2 | 3 or more |
| Examples | 2, 3, 5, 7, 11 | 4, 6, 8, 9, 10 |
| Can be split into smaller factors? | No | Yes, such as 9 = 3 × 3 |
| Smallest one | 2 | 4 |
| Even ones | Only 2 | All even numbers from 4 up |
The numbers 0 and 1 are neither prime nor composite. Zero has endless factors, since every number divides into 0, and 1 has just one factor.
List Of Prime Numbers From 1 To 100
There are exactly 25 prime numbers between 1 and 100. Here they are, grouped by tens:
| Range | Prime numbers | Count |
|---|---|---|
| 1 to 10 | 2, 3, 5, 7 | 4 |
| 11 to 20 | 11, 13, 17, 19 | 4 |
| 21 to 30 | 23, 29 | 2 |
| 31 to 40 | 31, 37 | 2 |
| 41 to 50 | 41, 43, 47 | 3 |
| 51 to 60 | 53, 59 | 2 |
| 61 to 70 | 61, 67 | 2 |
| 71 to 80 | 71, 73, 79 | 3 |
| 81 to 90 | 83, 89 | 2 |
| 91 to 100 | 97 | 1 |
| Total | 25 |
The primes between 100 and 200 are: 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197 and 199. That is 21 more.
Notice how the gaps start to grow. The 1 to 10 row has four primes, while 91 to 100 has only one.
How To Check If A Number Is Prime
To check if a number is prime, try dividing it by each prime number up to its square root. If none of them divide evenly, the number is prime. This is the same method a basic prime number checker uses behind the scenes.
Step 1: Use Quick Divisibility Rules
Start by ruling out the easy cases. These rules let you test small primes without long division.
| Divisible by | Rule | Example |
|---|---|---|
| 2 | Last digit is 0, 2, 4, 6 or 8 | 358 |
| 3 | Sum of the digits is divisible by 3 | 51 (5 + 1 = 6) |
| 5 | Last digit is 0 or 5 | 145 |
| 7 | Double the last digit and subtract it from the rest; the result is divisible by 7 | 91 (9 – 2 = 7) |
| 11 | Alternating sum of digits is 0 or divisible by 11 | 143 (1 – 4 + 3 = 0) |
If any rule fits, the number is composite and you can stop. For example, 51 looks prime to many people, but 5 + 1 = 6, so 51 = 3 × 17.
Step 2: Test Primes Only Up To The Square Root
You never need to test past the square root of the number. If a number has a factor bigger than its square root, it must also have one smaller than the square root, and you would already have found that one.
Example: Is 221 prime?
- √221 is about 14.9, so test primes up to 13: 2, 3, 5, 7, 11, 13.
- 2, 3, 5, 7 and 11 do not divide evenly.
- 221 ÷ 13 = 17 exactly.
- 221 is composite (13 × 17).
Example: Is 1,009 prime?
- √1,009 is about 31.8, so test primes up to 31.
- That is 11 primes: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31.
- None divide evenly.
- 1,009 is prime.
A square root calculator tells you where to stop testing when the number is large.
Worked Examples: Prime Or Not?
These are the numbers people get wrong most often. Each one looks prime but is not, except where noted.
| Number | Prime? | Why |
|---|---|---|
| 51 | No | 3 × 17 |
| 57 | No | 3 × 19 |
| 87 | No | 3 × 29 |
| 91 | No | 7 × 13 |
| 97 | Yes | No prime up to 9 divides it |
| 119 | No | 7 × 17 |
| 143 | No | 11 × 13 |
| 899 | No | 29 × 31 |
| 2,027 | Yes | No prime up to 45 divides it |
Numbers like 91, 143 and 899 trick people because their smallest factor is fairly large. The square root method catches them every time.
How Computers Test Very Large Numbers
Checking every prime up to the square root works for small numbers, but it is far too slow for numbers with hundreds or millions of digits. Computers use smarter tests instead.
Probable prime tests. A test based on Fermat's little theorem picks a number a and checks whether aⁿ⁻¹ leaves a remainder of 1 when divided by n. Every prime passes. Most composite numbers fail quickly, so a pass means "almost certainly prime."
Watch out for fakes. A few composite numbers, called Carmichael numbers, pass the basic Fermat test for every base a that shares no factor with them. The smallest is 561 = 3 × 11 × 17. Stronger tests, such as the Miller-Rabin test, close this gap and are what most software uses today.
Special tests for special primes. Mersenne numbers (2ⁿ – 1) have their own fast test, the Lucas-Lehmer test. That is one reason the largest known primes are almost always Mersenne primes.
The Sieve Of Eratosthenes
The Sieve of Eratosthenes is a simple way to find every prime up to a chosen number by crossing out multiples. It is named after Eratosthenes, a Greek scholar from the 3rd century BCE.
Here is how to find all primes up to 100:
- Write the numbers 2 to 100 in a grid.
- Circle 2, then cross out every multiple of 2 (4, 6, 8 and so on).
- Circle the next number not crossed out, which is 3. Cross out its multiples (6, 9, 12 and so on).
- Circle 5 and cross out its multiples. Then do the same with 7.
- Stop there. Since √100 = 10, any composite number up to 100 has a factor of 7 or less.
- Every number left uncrossed is prime.
You will end up with the same 25 primes from the list above. The sieve is great for classrooms because students see the pattern of multiples forming stripes and columns on the grid.
Prime Factorization: Breaking Numbers Into Primes
Prime factorization means writing a number as a product of primes. Every whole number above 1 has exactly one prime factorization, a rule known as the Fundamental Theorem of Arithmetic.
Factor tree for 360:
- 360 = 36 × 10
- 36 = 6 × 6 = 2 × 3 × 2 × 3
- 10 = 2 × 5
- Collect the primes: 2 × 2 × 2 × 3 × 3 × 5
- Write with exponents: 360 = 2³ × 3² × 5
You can start the tree with any pair of factors, like 360 = 4 × 90 or 360 = 12 × 30. The final list of primes will always be the same.
Prime factorization is the engine behind several everyday math skills:
- Finding the greatest common factor, which you can check with a GCF calculator
- Finding the least common multiple, which an LCM calculator works out in seconds
- Reducing fractions to lowest terms, as the fraction simplifier does
- Listing every factor of a number, which a factor calculator handles for large values
Prime Vs Coprime: Not The Same Thing
Two numbers are coprime (also called relatively prime) when their only common factor is 1. The numbers themselves do not need to be prime.
| Pair | Common factors | Coprime? | Are both prime? |
|---|---|---|---|
| 8 and 15 | 1 | Yes | No, both are composite |
| 7 and 13 | 1 | Yes | Yes |
| 9 and 12 | 1, 3 | No | No |
| 14 and 21 | 1, 7 | No | No |
Coprime pairs matter when simplifying fractions. A fraction is in lowest terms exactly when its numerator and denominator are coprime, so 8/15 cannot be reduced even though neither number is prime.
Types Of Prime Numbers
Mathematicians have named many special groups of primes based on patterns they follow. These are the ones you are most likely to meet.
| Type | What it means | Examples |
|---|---|---|
| Twin primes | Two primes that differ by 2 | (3, 5), (11, 13), (17, 19), (71, 73) |
| Mersenne primes | Primes of the form 2ⁿ – 1 | 3, 7, 31, 127 |
| Emirps | Primes that make a different prime when the digits are reversed | 13 and 31, 17 and 71, 37 and 73 |
| Palindromic primes | Primes that read the same both ways | 11, 101, 131, 151 |
| Sophie Germain primes | Primes p where 2p + 1 is also prime | 2, 3, 5, 11, 23, 29 |
There are 8 twin prime pairs below 100: (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61) and (71, 73).
Mersenne primes deserve a closer look. 2ⁿ – 1 can only be prime when n is itself prime, but a prime n does not guarantee it. For example, 2¹¹ – 1 = 2,047 = 23 × 89. That is why each new Mersenne prime takes a huge amount of computer time to confirm.
Patterns In Prime Numbers
Primes look random at first, but they follow a few reliable patterns that help you spot them faster.
Last digits. After 2 and 5, every prime ends in 1, 3, 7 or 9. A number ending in 0, 2, 4, 6 or 8 is even, and one ending in 5 is divisible by 5.
The 6k ± 1 rule. Every prime greater than 3 is one more or one less than a multiple of 6. For example, 29 = 30 – 1 and 37 = 36 + 1. The reverse is not true, though: 25 = 24 + 1 fits the pattern but is 5 × 5.
Primes thin out. They get rarer as numbers grow, but they never run out.
| Range | Number of primes | Share of numbers that are prime |
|---|---|---|
| 1 to 100 | 25 | 25% |
| 1 to 1,000 | 168 | 16.8% |
| 1 to 10,000 | 1,229 | About 12.3% |
| 1 to 1,000,000 | 78,498 | About 7.8% |
Prime Numbers Facts That Surprise Most People
Prime numbers have a long history and a surprising number of real-world jobs. These prime numbers facts are some of the most interesting.
- The largest known prime has over 41 million digits. It is 2¹³⁶²⁷⁹⁸⁴¹ – 1, found on October 12, 2024, by Luke Durant, a researcher from San Jose, California. It has 41,024,320 digits.
- Volunteers find most record primes. That record came from the Great Internet Mersenne Prime Search (GIMPS), a project where people donate computer time to test huge numbers.
- Only 52 Mersenne primes are known. Every new one is a major event, because testing a single candidate can take days of computing.
- Your online security depends on primes. Encryption systems such as RSA multiply two very large primes together. Multiplying is fast, but working backward to find the two primes from their product is extremely slow, which keeps messages private.
- Cicadas may use primes to survive. Periodical cicadas in eastern North America come out of the ground every 13 or 17 years. One theory is that these prime cycles make it harder for predators with shorter cycles to line up with them.
- 2 and 3 are the only primes that sit next to each other. Any two numbers in a row include an even number, and 2 is the only even prime. So no other pair of neighbors can both be prime.
- The number 2,027 is prime. So next year is a prime year. The last prime year was 2017.
- Prime gaps can be as long as you like. For any length you pick, there is a stretch of that many composite numbers in a row somewhere on the number line.
- The digits of a prime never add up to a multiple of 3, except for 3 itself. If they did, the number would be divisible by 3.
Famous Unsolved Prime Number Problems
Some of the hardest open questions in math are about primes. They are easy to state but no one has proved them.
| Problem | What it says | Status |
|---|---|---|
| Goldbach's conjecture | Every even number greater than 2 is the sum of two primes (10 = 3 + 7) | Unproven since Christian Goldbach raised it in a 1742 letter to Leonhard Euler |
| Twin prime conjecture | There are infinitely many twin prime pairs | Unproven; in 2013 Yitang Zhang proved there are infinitely many prime pairs that differ by at most 70 million |
| Riemann hypothesis | Describes exactly how primes are spread out | Unproven; one of the Clay Mathematics Institute's Millennium Prize Problems, with a $1 million prize |
Computers have checked Goldbach's conjecture for a huge range of even numbers, and it has always held. But checking examples is not a proof, which is why it remains open.
When Students Learn About Prime Numbers
In schools that follow the Common Core State Standards, students start working with prime numbers in grade 4. They build on the idea in grade 6 and beyond.
| Grade | What students do |
|---|---|
| Grade 4 | Find all factor pairs of a whole number from 1 to 100 and decide whether it is prime or composite |
| Grade 6 | Use factors to find the greatest common factor and least common multiple of whole numbers |
| Middle and high school | Use prime factorization to simplify fractions, radicals and algebra expressions |
A fun way to practice at home is a "prime hunt." Pick a page of a book, read every page number, and say "prime" or "composite" out loud. Kids get quick feedback and learn the small primes by heart.
Common Mistakes To Avoid
Most mistakes with prime numbers come from assuming odd numbers are prime or forgetting the special cases of 0, 1 and 2.
| Mistake | Why it is wrong | Fix |
|---|---|---|
| Calling 1 prime | 1 has only one factor | Primes start at 2 |
| Thinking all odd numbers are prime | 9, 15, 21, 27 and 51 are odd and composite | Test with divisibility rules |
| Thinking 2 is not prime because it is even | 2 has exactly two factors, 1 and 2 | 2 is the only even prime |
| Testing every number up to n | Wastes time | Stop at the square root |
| Testing composite divisors | If 4 divides a number, 2 already does | Test primes only |
| Stopping too early | 91 passes the tests for 2, 3 and 5 | Keep going: 91 = 7 × 13 |
Practice Problems With Answers
Try these, then check below.
- Is 47 prime?
- Is 87 prime?
- List the primes between 50 and 70.
- Find the prime factorization of 84.
- Is 323 prime? (Hint: √323 is about 18)
- What is the next prime after 113?
Answers
- Yes. √47 is about 6.9, and 2, 3 and 5 do not divide it.
- No. 8 + 7 = 15, which is divisible by 3, so 87 = 3 × 29.
- 53, 59, 61 and 67.
- 84 = 2 × 2 × 3 × 7, or 2² × 3 × 7.
- No. 323 = 17 × 19.
- Every number from 114 to 126 is composite.
Summary
A prime number is a whole number greater than 1 with exactly two factors, 1 and itself. 2 is the smallest and the only even prime, and 1 is not prime. There are 25 primes up to 100 and infinitely many in total.
To check a number, use divisibility rules first, then test primes up to the square root. Prime factorization breaks any number into primes in exactly one way, which powers GCF, LCM and fraction work.
Next step: use the Sieve of Eratosthenes to find every prime up to 200 on your own, then compare your list with the one above.
Frequently Asked Questions
What are the first 10 prime numbers?
The first 10 prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23 and 29. Their sum is 129. All of them except 2 are odd. A quick way to remember the start of the list is that every single-digit prime (2, 3, 5 and 7) appears first, followed by the "teen" primes 11, 13, 17 and 19.
How do you explain prime numbers to a child?
Give the child a set of objects, like 12 blocks, and ask them to build rectangles. Twelve blocks can make 2 rows of 6 or 3 rows of 4. Then try 7 blocks. The only option is one long row. Explain that numbers that can only make one long row are called prime, and numbers that can make other rectangles are called composite.
Is 51 a prime number?
No, 51 is not prime. It equals 3 × 17, so its factors are 1, 3, 17 and 51. Many people guess it is prime because it is odd and does not end in 5. The quick check is to add its digits: 5 + 1 = 6. Since 6 is divisible by 3, the number 51 is divisible by 3 as well.
Are there infinitely many prime numbers?
Yes. The Greek mathematician Euclid proved it around 300 BCE. His idea: multiply any list of primes together and add 1. The new number leaves a remainder of 1 when divided by every prime on the list, so it must have a prime factor that was not on the list. That means no list of primes can ever be complete.
What is the largest prime number under 1,000?
The largest prime number under 1,000 is 997. Its square root is about 31.6, and none of the 11 primes up to 31 divide it evenly. The numbers 998 and 999 are both composite, since 998 is even and 999 = 27 × 37. There are 168 prime numbers below 1,000 in total.
Can a prime number end in 5?
Only one prime ends in 5, and that is 5 itself. Every other number ending in 5, such as 15, 25 or 105, can be divided by 5, so it has at least three factors. For the same reason, no prime number ends in 0. Apart from 2 and 5, every prime number ends in 1, 3, 7 or 9.
Try it with your own numbers
Use a free CalcSolver tool to check the examples in this guide.