The least common multiple of 16 and 9 is 144. Because 16 and 9 share no prime factors at all, their LCM is simply their product, which makes this pair one of the cleanest examples for learning how the least common multiple (LCM) actually works. Below you will find four different ways to reach that answer, an explanation of why the shortcut works here, and a look at where this calculation shows up in real life Turns out it matters..
What the Least Common Multiple Really Means
The least common multiple of two numbers is the smallest positive whole number that both numbers divide into evenly, with no remainder. Put another way, if you were counting by 16s and counting by 9s at the same time, the LCM is the first number where both counting sequences land together.
You'll probably want to bookmark this section.
Two ideas are worth separating clearly:
- A multiple of a number is what you get by multiplying it by 1, 2, 3, 4, and so on. Multiples are infinite in quantity.
- A common multiple is a number that appears in the multiple list of both numbers.
- The least common multiple is the smallest of those shared values.
Every pair of numbers has infinitely many common multiples, but only one smallest one. For 16 and 9, that value is 144.
Method 1: Listing the Multiples
This is the most intuitive approach and the best one for building understanding, even though it becomes slow with large numbers.
Multiples of 16: 16, 32, 48, 64, 80, 96, 112, 128, 144, 160, 176, 192…
Multiples of 9: 9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, 108, 117, 126, 135, 144, 153…
Scanning both lists, the first value that appears in each one is 144. Still, notice that it takes nine steps of 16 and sixteen steps of 9 to get there. That is not a coincidence, and the next method explains why.
Method 2: Prime Factorization (The Most Reliable Method)
Prime factorization breaks each number down into a product of prime numbers. This method works for any pair of numbers, no matter how large Nothing fancy..
Step 1 — Factor 16: 16 = 2 × 2 × 2 × 2 = 2⁴
Step 2 — Factor 9: 9 = 3 × 3 = 3²
Step 3 — Take the highest power of every prime that appears:
- The prime 2 appears as 2⁴ (from 16) and not at all in 9. Highest power: 2⁴
- The prime 3 appears as 3² (from 9) and not at all in 16. Highest power: 3²
Step 4 — Multiply those highest powers: LCM = 2⁴ × 3² = 16 × 9 = 144
The logic behind this is straightforward. Any common multiple of 16 and 9 must contain enough factors of 2 to cover 16 and enough factors of 3 to cover 9. The smallest number that satisfies both requirements uses each prime exactly as many times as the number that needs it most That's the whole idea..
Method 3: The GCD Formula
There is a well-known relationship between the greatest common divisor (GCD, also called the greatest common factor) and the LCM of two numbers:
LCM(a, b) × GCD(a, b) = a × b
Rearranged to solve for the LCM:
LCM(a, b) = (a × b) ÷ GCD(a, b)
Now find the GCD of 16 and 9. Still, the factors of 16 are 1, 2, 4, 8, 16. The factors of 9 are 1, 3, 9 That alone is useful..
GCD(16, 9) = 1
Substituting into the formula:
LCM(16, 9) = (16 × 9) ÷ 1 = 144 ÷ 1 = 144
This method is fast, but it depends on finding the GCD first. For larger numbers, the Euclidean algorithm makes that step quick: divide the larger number by the smaller, then replace the larger number with the remainder and repeat until the remainder is zero. Applied here, 16 ÷ 9 leaves a remainder of 7; 9 ÷ 7 leaves 2; 7 ÷ 2 leaves 1; 2 ÷ 1 leaves 0. The last nonzero remainder is 1, confirming the GCD Still holds up..
Method 4: The Ladder (Division) Method
Write the two numbers side by side and divide by prime numbers as long as at least one of them is divisible Simple, but easy to overlook..
2 | 16 9
2 | 8 9
2 | 4 9
2 | 2 9
3 | 1 9
3 | 1 3
1 1
Multiply every number down the left side: 2 × 2 × 2 × 2 × 3 × 3 = 144. The 9 is carried down unchanged through the four divisions by 2 because 9 is not divisible by 2, and the 16 becomes 1 after four divisions. This visual layout makes it easy to see that the two numbers never share a divisor greater than 1 Not complicated — just consistent..
People argue about this. Here's where I land on it.
Why 16 and 9 Are a Special Case
Sixteen and nine are coprime, also called relatively prime
Because they share no common prime factors, the least common multiple of 16 and 9 is simply their product, 144. This property holds for any two numbers that are relatively prime: the smallest multiple they both divide into is the result of multiplying them together. This means the calculation becomes a matter of straightforward multiplication rather than a search for overlapping factors And that's really what it comes down to..
Understanding this relationship is useful beyond textbook exercises. In real‑world scenarios such as synchronizing recurring events — like traffic lights, work shifts, or planetary orbits — the LCM tells you after how many units the cycles will align. When the cycles are coprime, the alignment occurs exactly after the product of their lengths, which simplifies planning and reduces the chance of error.
The four techniques presented each arrive at the same answer, reinforcing confidence in the result. Prime factorization makes the underlying structure explicit, the GCD formula leverages a quick division process, and the ladder method offers a visual, step‑by‑step pathway that is easy to follow for learners of all ages. Together, they illustrate both the flexibility and reliability of mathematical reasoning when determining common multiples.
The short version: the LCM of 16 and 9 is 144, and the consistency across multiple methods underscores the robustness of the underlying mathematical principles. Whether one prefers a conceptual view through prime factors, an algorithmic shortcut via the GCD, or a concrete visual layout, each approach confirms that the smallest common multiple of these two coprime numbers is their product.
Common Pitfalls to Watch For
Even a straightforward calculation like this one invites a few predictable mistakes, and recognizing them in advance saves time.
- Confusing LCM with GCD. The greatest common divisor of 16 and 9 is 1, while the least common multiple is 144. The two quantities sit at opposite ends of the same relationship, so mixing them up reverses the meaning of the answer entirely.
- Multiplying by default. The "just multiply them" shortcut works only for coprime pairs. For 16 and 12, the product is 192, yet the LCM is 48, because the shared factor of 4 must not be counted twice.
- Dropping the carried number in the ladder. When a prime fails to divide one of the entries, that entry must be rewritten unchanged on the next line. Omitting it breaks the layout and corrupts the final product.
- Stopping the Euclidean algorithm early. The process is finished only when the remainder reaches zero; the answer is the last nonzero remainder, not the one that produced the zero.
A Quick Sanity Check
Verification takes only seconds. Divide the result by each original number: 144 ÷ 16 = 9 and 144 ÷ 9 = 16, both whole numbers, so 144 is genuinely a common multiple. To confirm it is the least, note that any common multiple of 16 must come from the list 16, 32, 48, 64, 80, 96, 112, 128, 144 — and the first of these divisible by 9 is 144 itself.
Try These Yourself
- 12 and 15 → 60
- 8 and 20 → 40
- 7 and 13 → 91 (another coprime pair, so the product applies)
- 24 and 36 → 72
Working these out with two different methods each will build the fluency needed to spot when the shortcut is legitimate and when it is not.
Conclusion
The least common multiple of 16 and 9 is 144, a result that follows directly from the fact that the two numbers share no prime factors. Here's the thing — more importantly, the journey to that number demonstrates how a single arithmetic question can be approached from several directions — structural, algorithmic, and visual — with each route shedding light on the others. Mastering these alternatives does more than produce a correct answer; it builds the habit of checking work through independent reasoning, a skill that carries forward into fractions, modular arithmetic, scheduling problems, and every other corner of mathematics where patterns must be reconciled And it works..
