LCM of 60 and 243 = 4860
Quick Answer
LCM(60 and 243) = 4860.
First common multiples: 4860, 9720, 14580, 19440, 24300. Related GCF: 3.
LCM Calculator
Step-by-Step: LCM via the GCF Identity
The fastest way to compute the LCM uses the identity LCM(a, b) × GCF(a, b) = a × b. So LCM = (a × b) / GCF. We first find the GCF with the Euclidean algorithm, then apply the identity.
Euclidean reduction for (60, 243):
| Step | Dividend ÷ Divisor | Quotient | Remainder |
|---|---|---|---|
| 1 | 243 ÷ 60 | 4 | 3 |
| 2 | 60 ÷ 3 | 20 | 0 |
GCF = 3. Applying the identity:
LCM = (60 × 243) ÷ GCF = 14580 ÷ 3 = 4860
LCM(60 and 243) = 4860
First 5 Common Multiples of 60 and 243
Every common multiple is a multiple of the LCM. The first five are:
| k | k × LCM | Value |
|---|---|---|
| 1 | 1 × 4860 | 4,860 |
| 2 | 2 × 4860 | 9,720 |
| 3 | 3 × 4860 | 14,580 |
| 4 | 4 × 4860 | 19,440 |
| 5 | 5 × 4860 | 24,300 |
Related: GCF of 60 and 243
GCF(60, 243) = 3
From the identity LCM × GCF = a × b:
4860 × 3 = 14580 = 60 × 243
See the dedicated GCF of 60 and 243 page for the full common-divisor list and Euclidean walk-through.
Explore Each Number Individually
How to Find the Least Common Multiple
The Least Common Multiple (LCM) of two or more positive integers is the smallest positive integer divisible by each of them.
Method 1: GCF Identity (used above)
- Find the GCF (Greatest Common Factor) using the Euclidean algorithm.
- Apply the identity: LCM = (a × b) / GCF.
Method 2: Prime Factorization
- Find the prime factorization of each number.
- For each prime that appears in any factorization, take the highest exponent across all inputs.
- Multiply these prime powers together.
Example: LCM(12, 18) via prime factorization
- 12 = 2² × 3¹
- 18 = 2¹ × 3²
- Take the highest exponent of each prime: 2² (from 12), 3² (from 18).
- LCM = 2² × 3² = 4 × 9 = 36
Method 3: Listing Multiples
- List the multiples of each number until you find a common one.
- That smallest common multiple is the LCM.
This is the slowest method for large inputs; the GCF identity is preferred.
Nearby LCM Examples
| Pair | LCM | GCF |
|---|---|---|
| 100 and 150 | 300 | 50 |
| 75 and 100 | 300 | 25 |
| 72 and 96 | 288 | 24 |
| 60 and 90 | 180 | 30 |
| 45 and 60 | 180 | 15 |
| 36 and 48 | 144 | 12 |
Frequently Asked Questions
What is the LCM of 60 and 243?
LCM(60 and 243) = 4860. This is the smallest positive integer divisible by each input.
How is the LCM of 60 and 243 calculated?
Apply the identity LCM = (a × b) / GCF. For 60 and 243, GCF = 3, so LCM = 14580 / 3 = 4860.
How are LCM and GCF related?
By the identity LCM(a, b) × GCF(a, b) = a × b. So once you have the GCF (via the Euclidean algorithm), the LCM follows immediately: LCM = (a × b) / GCF.
What is LCM used for?
Two major uses: (1) adding/subtracting fractions with different denominators (find the common denominator); (2) scheduling — when two repeating events occur together (every 12 days and every 18 days → coincide every LCM(12, 18) = 36 days).
Related Calculators
- GCF of 60 and 243 = 3
- Prime Factorization Calculator
- Divisors of a Number
- Multiples of a Number
- Fraction Calculator (uses LCM for common denominators)
LCM Calculator
