How to Determine the Number of Divisors of an Integer: 10 Steps

Some math skills feel like they were invented just to make homework longer. Counting the number of divisors of an integer is not one of them. In fact, once you learn the pattern, it becomes one of the cleanest tricks in number theory. What looks like a messy pile of factors can turn into a neat little multiplication problem. Very satisfying. Almost suspiciously satisfying.

If you have ever stared at a number like 360 and thought, “Do I really have to list every divisor by hand?” the good news is no. You do not need to write out 1, 2, 3, 4, 5, 6, 8, 9, 10, and half your afternoon. The smart route is to use prime factorization. Once you break a number into prime powers, the total number of divisors falls right out of the exponents.

This guide walks you through 10 simple steps to determine the number of divisors of an integer, with examples, shortcuts, and common mistakes to avoid. Unless otherwise stated, we will count positive divisors, which is the standard convention in most school math and number theory problems.

Why This Method Works

Every integer greater than 1 can be written uniquely as a product of prime numbers. That idea is the foundation of divisor counting. Once a number is written in prime factorized form, each divisor is created by choosing how many copies of each prime to include. Count those choices correctly, and you count the divisors. That is the whole game.

The 10-Step Method

Step 1: Decide Which Divisors You Are Counting

Most problems asking for the number of divisors mean positive divisors. For example, the positive divisors of 12 are 1, 2, 3, 4, 6, and 12, so 12 has 6 positive divisors.

If the integer is negative, start with its absolute value. For instance, to count the positive divisors of -24, just work with 24. If a problem asks for all integer divisors, including negative ones, then a nonzero number has twice as many total integer divisors as positive divisors. So 24 has 8 positive divisors and 16 integer divisors if you include negatives.

Step 2: Check the Easy Special Cases First

Before diving into factorization, clear the easy cases off the table:

• 1 has exactly 1 positive divisor: itself.
• A prime number has exactly 2 positive divisors: 1 and itself.
• 0 is a special case and does not use the usual divisor-counting formula.

These small cases matter because they show up a lot in homework, contest problems, and exam traps written by people who apparently enjoy tiny surprises.

Step 3: Find the Prime Factorization of the Integer

This is the heart of the method. Break the number into a product of primes.

Example:

72 = 2 × 2 × 2 × 3 × 3 = 2³ × 3²

You can use a factor tree, repeated division, or divisibility rules to do this. For large numbers, test small prime factors first: 2, 3, 5, 7, 11, and so on.

Step 4: Write the Factorization Using Exponents

Once you have the prime factors, group identical primes together using exponents. This makes the pattern easier to see.

For example:

• 60 = 2² × 3¹ × 5¹
• 144 = 2⁴ × 3²
• 441 = 3² × 7²

The exponents matter because they tell you how many choices you have when building divisors.

Step 5: Add 1 to Each Exponent

Here comes the magic move. If a number has prime factorization

n = p₁^a × p₂^b × p₃^c …

then the number of positive divisors is:

(a + 1)(b + 1)(c + 1)…

Why add 1? Because for each prime, you can choose exponent 0, 1, 2, and so on up to the exponent in the original number. That makes one more choice than the exponent itself.

For 2³, you can choose 2⁰, 2¹, 2², or 2³. That is 4 choices, not 3.

Step 6: Multiply the Results

Now multiply those “exponent plus one” values.

For 72 = 2³ × 3², the number of divisors is:

(3 + 1)(2 + 1) = 4 × 3 = 12

So 72 has 12 positive divisors.

That is it. Seriously. That is the whole formula. Elegant, fast, and much better than writing out divisor lists until your pencil files a complaint.

Step 7: Test the Formula on a Small Number

It helps to verify the method on a number whose divisors you can list by hand.

Take 12:

12 = 2² × 3¹

Apply the formula:

(2 + 1)(1 + 1) = 3 × 2 = 6

Now list the positive divisors of 12:

1, 2, 3, 4, 6, 12

There are 6. The formula works perfectly.

This step is useful because it turns the rule from a memorized trick into something you actually trust.

Step 8: Use Factor Pairs as a Reality Check

Divisors tend to come in pairs. If d divides n, then n ÷ d is another divisor. For 36, the factor pairs are:

• 1 and 36
• 2 and 18
• 3 and 12
• 4 and 9
• 6 and 6

This is why non-square numbers usually have an even number of divisors. Their divisors pair off neatly. But perfect squares have one unpaired middle divisor, the square root. That makes the total number of divisors odd.

Example: 36 = 2² × 3²

(2 + 1)(2 + 1) = 9

Since 36 is a perfect square, an odd result makes sense.

Step 9: Watch Out for Common Mistakes

Here are the mistakes that trip people up most often:

• Forgetting the +1 rule. Students often multiply the exponents instead of adding 1 first.
• Incomplete prime factorization. If you stop at 12 = 3 × 4, you are not done, because 4 is not prime.
• Mixing up factors and multiples. Factors divide the number. Multiples are built from the number.
• Ignoring the meaning of the question. Positive divisors? All integer divisors? Proper divisors? Read carefully.
• Using the formula on 0. Do not. Zero is its own strange little kingdom.

The good news is that once you understand the logic, these mistakes become much easier to catch.

Step 10: Practice with Bigger Examples

Let us finish with a few examples that show how fast this method becomes once you get comfortable with it.

Example 1: How many divisors does 360 have?

Prime factorization:

360 = 2³ × 3² × 5¹

Apply the formula:

(3 + 1)(2 + 1)(1 + 1) = 4 × 3 × 2 = 24

So 360 has 24 positive divisors.

Example 2: How many divisors does 840 have?

Prime factorization:

840 = 2³ × 3¹ × 5¹ × 7¹

Apply the formula:

(3 + 1)(1 + 1)(1 + 1)(1 + 1) = 4 × 2 × 2 × 2 = 32

So 840 has 32 positive divisors.

Example 3: How many divisors does 441 have?

Prime factorization:

441 = 3² × 7²

Apply the formula:

(2 + 1)(2 + 1) = 3 × 3 = 9

Because 441 is a perfect square, getting an odd number of divisors is exactly what we expect.

A Quick Summary Formula

If

n = p₁^a₁ × p₂^a₂ × … × p_k^a_k

then the number of positive divisors of n is

(a₁ + 1)(a₂ + 1)…(a_k + 1)

That is the cleanest way to determine the divisor count of an integer without listing every factor.

What You Experience When Learning Divisor Counting

Learning how to determine the number of divisors of an integer usually starts with brute force. Most students begin by listing factor pairs one by one: 1 and the number, then 2 and whatever is left, then 3 if it works, then maybe 4, and so on. At first, this feels reasonable. For 12 or 18, it works just fine. Then a number like 360 shows up, and suddenly the old method feels like trying to count grains of rice with boxing gloves on. That is usually the moment when divisor counting goes from “basic arithmetic” to “I really need a better system.”

One of the most common experiences is the lightbulb moment that happens when prime factorization finally connects to counting. Before that moment, prime factorization can feel like a separate skill: useful for homework, sure, but not obviously exciting. Then someone shows that every divisor of a number is made by choosing exponents from the prime factorization, and the whole topic starts making sense. Instead of memorizing a formula, you realize why the formula exists. That shift matters. It turns a rule into a tool.

Another common experience is making the same mistake several times before the method sticks. A student writes 72 = 2³ × 3² and proudly says the answer is 3 × 2 = 6. Close, but not quite. The missing “plus one” is practically a rite of passage. It happens because the brain sees exponents and wants to use them directly. Once you understand that each exponent represents a range of choices from 0 up to that value, the mistake starts to disappear. Still, almost everybody trips over it once. Some people trip over it twice. A few heroic souls make it a personality trait for a week.

People also notice that divisor counting sharpens number sense. You start spotting structure faster. A perfect square no longer looks ordinary, because you know it must have an odd number of divisors. A prime number stops being just “a number with two factors” and becomes the simplest possible case in the divisor formula. Even checking divisibility by small primes starts feeling more strategic. You stop guessing and start reading numbers more intelligently.

In classroom settings, divisor counting often becomes more enjoyable when students compare methods. One student lists factors. Another uses factor pairs up to the square root. Another jumps straight to prime exponents. They all arrive at the same answer, but one method scales far better. That comparison gives students confidence, because they see not only how the fast method works but also why it saves time.

Over time, the experience becomes less about one formula and more about mathematical organization. Divisor counting teaches you to break a problem into structure, choices, and patterns. That is useful far beyond one chapter of math. It shows up in algebra, probability, contest math, and even computer science. So if this topic felt awkward at first, that is normal. Most people begin with clutter and end with clarity. That is the real experience: a messy-looking number becomes organized, predictable, and surprisingly elegant.

Note: This HTML contains only the body content, uses standard American English, and removes unnecessary placeholder elements for clean web publishing.

SEO Tags