Prime Numbers 1 to 100 — Full List

Among the numbers from 1 to 100, only 25 numbers are prime. The full list is short enough to read in one line, yet it opens the door to a much larger part of mathematics: divisibility, factors, composites, prime gaps, the Sieve of Eratosthenes, and the first patterns that appear in number theory. The primes in this range are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, and 97.

A prime number is a whole number greater than 1 with exactly two positive divisors: 1 and itself. That single definition explains why 1 does not appear in the list, why 2 is special, and why numbers such as 49, 51, 77, and 91 fail the prime test.

---

Prime Numbers From 1 to 100

The complete list of prime numbers from 1 to 100 contains 25 values. Read carefully and one detail appears right away: after 2, every prime number in this range is odd. Not a coincidence.

The phrase “from 1 to 100” usually means the endpoints are included. Here, that does not change the answer. 1 is not prime, and 100 is composite because it has several divisors, including 2, 4, 5, 10, 20, 25, and 50.

The List Split by Number Range

Breaking the list into smaller ranges makes the pattern easier to see. The early part of the number line has more primes packed close together; later, the gaps begin to widen. Still close, but less crowded.

Why This List Has 25 Primes

A number survives as prime only when no smaller positive divisor, other than 1, divides it evenly. In the first hundred numbers, that simple rule removes most candidates very fast. Even numbers fall away. Multiples of 3 fall away. Multiples of 5 and 7 remove many of the rest. What remains is the 25-number prime list.

There is no hidden exception in the range. Each number from 1 to 100 fits one of three labels:

• Prime: greater than 1 with exactly two positive divisors.
• Composite: greater than 1 with more than two positive divisors.
• Neither prime nor composite: the number 1.

Why 1 Is Not Included

The number 1 has only one positive divisor: itself. A prime number needs exactly two. So 1 is not prime, and it is not composite either. It sits in its own small category, quiet but necessary.

This choice keeps prime factorization clean. If 1 were called prime, a number such as 12 could be written as 2 × 2 × 3, or 1 × 2 × 2 × 3, or 1 × 1 × 2 × 2 × 3, with no natural stopping point. By keeping 1 outside the prime list, every integer greater than 1 has one stable prime factorization.

Why 2 Is the Only Even Prime

The number 2 is prime because its only positive divisors are 1 and 2. Every larger even number has 2 as a divisor, so it has at least three divisors: 1, 2, and itself. That makes 4, 6, 8, 10, and every later even number composite.

This is why the full list begins with an unusual entry: 2 is even, but prime. After that, all primes from 1 to 100 are odd.

How the List Is Formed Without Guesswork

The list can be built by testing divisibility, but mathematicians usually prefer a cleaner idea: remove the numbers that must be composite. This is the basic shape of the Sieve of Eratosthenes, a classic method for finding primes up to a chosen limit.

A Sieve View of the First Hundred Numbers

In the range 1 to 100, the sieve removes multiples of small primes. Multiples of 2 are composite, except 2 itself. Multiples of 3 are composite, except 3 itself. The same idea applies to 5 and 7. After those removals, no other composite can hide below 100.

• Multiples of 2 remove most even numbers: 4, 6, 8, 10, and so on.
• Multiples of 3 remove numbers such as 9, 15, 21, 27, 33, 39, and 99.
• Multiples of 5 remove 25, 35, 45, 55, 65, 75, 85, and 95.
• Multiples of 7 remove 49, 77, and 91 after smaller multiples have already been caught.

That last point matters. A composite number below 100 must have a prime factor no larger than 10. Since the primes up to 10 are 2, 3, 5, and 7, checking beyond 7 adds no new composite removals in this small range.

The Square Root Check Behind the List

A useful fact sits behind many primality checks: if a composite number n has a factor larger than √n, it must also have a matching factor smaller than √n. So a number up to 100 only needs possible prime divisors up to √100 = 10.

For example, 97 is not divisible by 2, 3, 5, or 7. Since no smaller prime divisor appears before the square-root boundary, 97 is prime. The number 91 fails because 91 = 7 × 13. Small clue, clear answer.

Patterns Inside the 1 to 100 Prime List

Prime numbers do not follow a simple repeating pattern, but the first hundred numbers still show useful structure. Some observations are exact. Others are early hints of deeper number theory.

Prime Counts by Ten-Number Ranges

The first two ten-number ranges contain four primes each. Near the end of the first hundred, the count thins out. This does not mean primes stop; they never do. It only shows that prime density begins to fall as numbers grow.

Last Digits That Appear

After 5, a prime number written in base 10 can only end in 1, 3, 7, or 9. A number ending in 0, 2, 4, 6, or 8 is even. A number ending in 5 is divisible by 5. That leaves four possible final digits for larger primes.

• Ending in 1: 11, 31, 41, 61, 71
• Ending in 3: 3, 13, 23, 43, 53, 73, 83
• Ending in 7: 7, 17, 37, 47, 67, 97
• Ending in 9: 19, 29, 59, 79, 89

The exceptions are easy to name: 2 and 5. They are prime, but their final digits would make larger numbers divisible by 2 or 5.

Prime Gaps Before 100

A prime gap is the distance between two neighboring primes. The early gaps are small: 2 to 3 has gap 1, then 3 to 5 has gap 2, and 5 to 7 has gap 2. Later, a larger pause appears.

Inside the 1 to 100 list, the largest gap between neighboring primes is 8. It appears between 89 and 97. The numbers between them — 90, 91, 92, 93, 94, 95, and 96 — all have smaller divisors.

Prime Factorization Near the List

Prime numbers matter because composite numbers split into primes. This is called prime factorization. For small numbers, the split is easy to see: 12 = 2 × 2 × 3, 30 = 2 × 3 × 5, and 84 = 2 × 2 × 3 × 7.

Within the first hundred numbers, every composite number uses primes from the same early pool. The list from 1 to 100 is not just a list to memorize; it is the raw material for factoring many nearby numbers.

• 49 is not prime because 49 = 7 × 7.
• 51 is not prime because 51 = 3 × 17.
• 77 is not prime because 77 = 7 × 11.
• 91 is not prime because 91 = 7 × 13.
• 97 is prime because no prime divisor up to 9 divides it evenly.

Related Prime Ideas That Start in This Range

The first hundred numbers already contain many prime-related ideas. Some are simple enough for early math study. Others connect to open questions and advanced number theory, far beyond the first page of a notebook.

Twin Primes

Twin primes are pairs of primes that differ by 2. The first hundred numbers contain several pairs: (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), and (71, 73).

Pairs like these help explain why prime gaps attract attention. Sometimes primes sit almost side by side. Sometimes they leave long stretches of composite numbers between them.

Coprime Numbers

Two numbers are coprime when their greatest common divisor is 1. They do not both need to be prime. For example, 8 and 15 are coprime because they share no positive divisor other than 1. Prime numbers make this idea easier to understand because a prime has so few divisors.

Every prime from the list is coprime to many nearby composite numbers. For instance, 7 and 20 are coprime, but 7 and 21 are not.

Mersenne and Fermat Primes

Some primes belong to named families. A Mersenne prime has the form 2^p − 1, where p is prime and the result is also prime. Small examples include 3, 7, and 31. A Fermat prime has the form 2²ⁿ + 1; within the first hundred, examples include 3, 5, 17, and 97.

These families show a useful lesson: a formula can produce prime candidates, but it does not guarantee primes forever. Number theory likes patterns. It also breaks them.

Why Small Prime Lists Still Matter

The primes from 1 to 100 look small, but they support many bigger ideas. They help with mental arithmetic, fractions, greatest common divisors, least common multiples, modular arithmetic, and the first steps toward proof-based mathematics.

Classroom Number Sense

A student who knows the first 25 primes can spot many composite numbers quickly. The list also helps with simplifying fractions. For example, recognizing that 39 = 3 × 13 makes 39/52 easier to reduce because 52 = 4 × 13.

Small primes create fast checks. Divisibility becomes visible.

Number Theory and Proof

Prime numbers are central to number theory because they organize the positive integers greater than 1. Euclid’s classic proof shows that primes never run out: given any finite list of primes, a new prime divisor can be found outside that list.

The first hundred primes are not the subject of that proof, of course, but they make the idea easier to feel. A finite list can be complete for a small range. It can never be complete for all natural numbers.

Computing and Primality Tests

Computers use algorithms to test whether numbers are prime. The Sieve of Eratosthenes works well for lists up to a fixed limit. Trial division works for small individual numbers. For very large numbers, modern primality tests use more advanced methods.

Small primes still appear in software, cryptography education, hashing examples, random-number studies, and algorithm practice. Real cryptographic systems use much larger primes, not the tiny values from 1 to 100, but the same definition remains underneath.

Common Misreadings About the 1 to 100 List

Most errors around this list come from three places: including 1, excluding 2, or missing composite numbers that look prime at first glance. A few examples clear up the usual confusion.

• 1 is not prime: it has only one positive divisor.
• 2 is prime: it has exactly two positive divisors, even though it is even.
• 9 is not prime: it equals 3 × 3.
• 21 is not prime: it equals 3 × 7.
• 57 is not prime: the digit sum is 12, so it is divisible by 3.
• 87 is not prime: the digit sum is 15, so it is divisible by 3.
• 93 is not prime: the digit sum is 12, so it is divisible by 3.

The most deceptive composites below 100 are often 49, 77, and 91. Each is odd, and none ends in 5, but each has a smaller factor.

Trusted Math References

The following references support the mathematical definitions and background ideas used on this page.

• NIST Digital Library of Mathematical Functions: Special Notation for Prime Numbers
• NIST Computer Security Resource Center: Prime Number Definition
• University of North Carolina Greensboro: Sieve of Eratosthenes
• University of Connecticut: The Infinitude of the Primes
• University of Chicago: Prime Number Theorem Notes

Prime Numbers 1 to 100 FAQ

What are the prime numbers from 1 to 100?

The prime numbers from 1 to 100 are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, and 97.

How many prime numbers are there from 1 to 100?

There are 25 prime numbers from 1 to 100. Since 1 and 100 are not prime, the same list also works for prime numbers between 1 and 100.

Is 1 a prime number?

No. 1 is not prime because it has only one positive divisor. A prime number must have exactly two positive divisors: 1 and itself.

Why is 2 included in the prime list?

2 is included because its only positive divisors are 1 and 2. It is the only even prime number.

What is the largest prime number under 100?

The largest prime number under 100 is 97. It is not divisible by 2, 3, 5, or 7, and no larger divisor needs to be checked before 100 because √100 = 10.

Are all odd numbers from 1 to 100 prime?

No. Many odd numbers are composite. For example, 9 = 3 × 3, 21 = 3 × 7, 49 = 7 × 7, 77 = 7 × 11, and 91 = 7 × 13.