Factors of 72: Complete Guide to All 12 Factors & Code Examples

Imagine you have 72 cookies and need to share them equally among friends without leftovers. How many ways can you do it? This isn't just a party planning problem—it's a perfect introduction to the factors of 72. Whether you're a student tackling math homework, a teacher preparing a lesson, or a developer writing code to find divisors, understanding the factors of 72 is a foundational skill. And because 72 is a composite number (it has more than two factors), it's an excellent case study for exploring factorization, prime numbers, and even algorithm optimization.

I've spent years working with numbers in both academic and professional settings, and I still find myself reaching for factor-based thinking when solving real-world problems—from splitting server loads to designing grid layouts. Let's dive into everything you need to know about the factors of 72, complete with code examples you can use today.

---

What Are the Factors of 72? The Complete List

Definition of a Factor

A factor is a number that divides another number exactly, leaving no remainder. Think of it as a perfect fit: if you can split 72 into equal groups without anything left over, the group size is a factor. Every number has at least two factors: 1 and itself. But 72 is a composite number because it has more than those two—12 factors in total, to be precise.

Here's a quick test: 72 ÷ 2 = 36, so 2 is a factor. 72 ÷ 5 = 14.4, so 5 is not. Simple, right? But finding all of them systematically takes a bit more work.

All 12 Factors of 72

The complete list of factors of 72 is: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72.

How do we get there? The most straightforward method is division: start at 1 and work your way up to the square root of 72 (about 8.5). For each number that divides 72 evenly, you've found two factors—the divisor and the quotient.

Let me walk through it:

• 72 ÷ 1 = 72 → factors: 1 and 72
• 72 ÷ 2 = 36 → factors: 2 and 36
• 72 ÷ 3 = 24 → factors: 3 and 24
• 72 ÷ 4 = 18 → factors: 4 and 18
• 72 ÷ 6 = 12 → factors: 6 and 12
• 72 ÷ 8 = 9 → factors: 8 and 9

Once we hit 9, we've already paired it with 8, so we stop. That's 12 factors in total. Notice how the pairs mirror each other—this symmetry is a handy sanity check when you're doing this manually.

---

Prime Factors of 72 and the Factor Tree Method

What Is Prime Factorization?

Prime numbers are the building blocks of all whole numbers. A prime number has exactly two factors: 1 and itself. Think of primes as the atoms of the number world—they can't be broken down further. Prime factorization is the process of expressing a number as a product of primes. The Fundamental Theorem of Arithmetic guarantees that every number has exactly one prime factorization (ignoring the order of factors).

For 72, the prime factors are 2 and 3. But how do we get there?

Building the Factor Tree for 72

A factor tree is my favorite way to visualize prime factorization. It's like a family tree for numbers. Here's how it works for 72:

Start with 72 at the top. Branch it into two factors—I usually pick 8 and 9 because they're easy to work with. Then break each branch down:

• 8 breaks into 2 × 2 × 2 (all primes)
• 9 breaks into 3 × 3 (both primes)

So 72 = 2 × 2 × 2 × 3 × 3. Using exponents, that's 2³ × 3².

I've used this method countless times when teaching junior developers about integer factorization. It's intuitive and visual—you can literally see the number decomposing into its atomic parts. The prime factors of 72 are simply 2 and 3, repeated as needed.

---

Factor Pairs of 72: Positive and Negative Pairs

Positive Factor Pairs

Factor pairs are two numbers that multiply together to give 72. Here are all six positive pairs:

Negative Factor Pairs

Here's something many students miss: negative numbers can also be factors. Since multiplying two negatives gives a positive, (-1, -72), (-2, -36), (-3, -24), (-4, -18), (-6, -12), and (-8, -9) are all valid factor pairs of 72.

In practice, negative factors are less common in everyday math problems. But if you're working with quadratic equations or certain programming scenarios (like finding divisors in a range that includes negative numbers), they matter. I once spent an hour tracking down a bug in a financial calculation because I forgot to account for negative factor pairs—never again.

---

How to Find Factors of 72 in Python (and Other Languages)

A Simple Python Function to Find All Factors

Let's start with the most straightforward approach. Here's a Python function that finds all factors of any positive integer:

def find_factors(n):
    factors = []
    for i in range(1, n + 1):
        if n % i == 0:
            factors.append(i)
    return factors

print(find_factors(72))

The % operator (modulo) checks if i divides n evenly. If n % i == 0, then i is a factor. This code is simple and readable—perfect for beginners. But it's not efficient for large numbers.

Optimizing the Algorithm with Square Root

The simple loop above runs in O(n) time. For n = 72, that's 72 iterations—no big deal. But what if you're finding factors of 10 million? You'd be waiting a while.

Here's the optimized version using the square root trick:

import math

def find_factors_optimized(n):
    factors = []
    for i in range(1, int(math.sqrt(n)) + 1):
        if n % i == 0:
            factors.append(i)
            if i != n // i:  # Avoid duplicate for perfect squares
                factors.append(n // i)
    return sorted(factors)

print(find_factors_optimized(72))

This runs in O(√n) time. For 72, we only loop up to 8 (the square root), then add the paired factors. The time complexity improvement is dramatic for large numbers—I've used this optimization in production code to reduce runtime from minutes to milliseconds when processing large datasets.

Code Examples in JavaScript, C++, and Ruby

Here are quick implementations in other languages:

JavaScript:

function findFactors(n) {
    let factors = [];
    for (let i = 1; i <= Math.sqrt(n); i++) {
        if (n % i === 0) {
            factors.push(i);
            if (i !== n / i) factors.push(n / i);
        }
    }
    return factors.sort((a, b) => a - b);
}
console.log(findFactors(72)); // [1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72]

C++:

#include <vector>
#include <cmath>
#include <algorithm>

std::vector<int> findFactors(int n) {
    std::vector<int> factors;
    for (int i = 1; i <= sqrt(n); i++) {
        if (n % i == 0) {
            factors.push_back(i);
            if (i != n / i) factors.push_back(n / i);
        }
    }
    sort(factors.begin(), factors.end());
    return factors;
}

Ruby:

def find_factors(n)
  factors = []
  (1..Math.sqrt(n)).each do |i|
    if n % i == 0
      factors << i
      factors << n / i if i != n / i
    end
  end
  factors.sort
end

p find_factors(72) # [1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72]

Each language follows the same logic—the square root optimization is universal. I've found that once you understand the algorithm in one language, porting it to others takes minutes.

---

Real-World Applications of the Factors of 72

Grouping and Sharing Problems

Let's return to our cookie scenario. With 72 cookies, you can share them equally among:

• 1 friend (72 cookies each—selfish, but valid)
• 2 friends (36 each)
• 3 friends (24 each)
• 4 friends (18 each)
• 6 friends (12 each)
• 8 friends (9 each)
• 9 friends (8 each)
• 12 friends (6 each)
• 18 friends (4 each)
• 24 friends (3 each)
• 36 friends (2 each)
• 72 friends (1 each)

That's 12 different ways to share without leftovers. I've used this exact logic when planning team sizes for software projects—72 developers, 12 teams of 6, each team working on a different module. The factors told me the possible team sizes.

Finding the Greatest Common Factor (GCF) with 72

The greatest common factor (GCF) of two numbers is the largest factor they share. To find the GCF of 72 and 48:

• Factors of 72: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72
• Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
• Common factors: 1, 2, 3, 4, 6, 8, 12, 24
• GCF: 24

This is crucial for simplifying fractions. 72/48 simplifies to 3/2 (divide both by 24). In programming, GCF calculations are used in everything from reducing ratios to optimizing memory allocation.

---

Fun Facts and Number Trivia About 72

Why 72 Is a Highly Composite Number

A highly composite number has more factors than any smaller number. 72 qualifies with 12 factors. Compare this to:

• 60 (also 12 factors)
• 48 (10 factors)
• 36 (9 factors)

In fact, 72 is the smallest number with exactly 12 factors. This makes it a favorite among mathematicians and puzzle creators. I've seen 72 used in everything from clock face designs to architectural proportions.

72 in Nature, History, and Astronomy

The number 72 pops up in surprising places:

• Bees and honeycombs: Hexagonal cells have 6 sides, and 6 is a factor of 72. The efficiency of hexagons in nature is a beautiful example of mathematical optimization.
• Euclid's Elements: Written around 300 BC, this foundational math text includes theorems about factors and prime numbers that we still use today.
• Solar precession: The sun's position relative to the stars shifts about 1 degree every 72 years. This means a full cycle takes roughly 26,000 years (72 × 360).

These connections remind me that factors aren't just abstract concepts—they're woven into the fabric of the universe.

---

Frequently Asked Questions

How many factors does 72 have?

72 has exactly 12 factors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, and 72. You can verify this using the prime factorization method: 72 = 2³ × 3². Add 1 to each exponent (3+1=4, 2+1=3) and multiply: 4 × 3 = 12.

What is the sum of all the factors of 72?

The sum is 195. Using the formula for sum of factors based on prime factorization: (2⁴ - 1)/(2 - 1) × (3³ - 1)/(3 - 1) = 15 × 13 = 195. This formula is incredibly useful when you need to calculate sums without listing every factor.

How do you find the factor tree of 72?

Start with 72 at the top. Branch into 8 and 9. Then break 8 into 2 × 2 × 2, and 9 into 3 × 3. The final prime factorization is 2³ × 3². The factor tree visually shows how 72 decomposes into its prime building blocks.

Is 72 a prime number?

No. 72 is a composite number because it has 12 factors. Prime numbers have exactly two factors: 1 and themselves. Since 72 has more than two factors, it's composite.

---

Conclusion

The 12 factors of 72—1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, and 72—are more than just a list. They represent the prime factorization 2³ × 3², six positive factor pairs, and countless real-world applications from sharing cookies to optimizing code. Whether you're a student learning divisibility rules or a developer writing efficient algorithms, understanding the factors of 72 gives you a practical tool for problem-solving.

Test your knowledge with our interactive quiz below, or try writing your own factor-finding function in Python! I promise, once you start seeing factors in everyday situations, you'll never look at numbers the same way again.