Enter an equation or problem
Camera input is not recognized!

Solution - Least common multiple (LCM) by prime factorization

508,540,032
508,540,032

Step-by-step explanation

1. Find the prime factors of 1,664

Tree view of the prime factors of 1,664: 2, 2, 2, 2, 2, 2, 2 and 13

The prime factors of 1,664 are 2, 2, 2, 2, 2, 2, 2 and 13.

2. Find the prime factors of 8,424

Tree view of the prime factors of 8,424: 2, 2, 2, 3, 3, 3, 3 and 13

The prime factors of 8,424 are 2, 2, 2, 3, 3, 3, 3 and 13.

3. Find the prime factors of 8,918

Tree view of the prime factors of 8,918: 2, 7, 7, 7 and 13

The prime factors of 8,918 are 2, 7, 7, 7 and 13.

4. Find the prime factors of 4,004

Tree view of the prime factors of 4,004: 2, 2, 7, 11 and 13

The prime factors of 4,004 are 2, 2, 7, 11 and 13.

5. Build a prime factors table

Determine the maximum number of times each prime factor (2, 3, 7, 11, 13) occurs in the factorization of the given numbers:

Prime factorNumber1,6648,4248,9184,004Max. occurrence
273127
304004
700313
1100011
1311111

The prime factors 11 and 13 occur one time, while 2, 3 and 7 occur more than once.

6. Calculate the LCM

The least common multiple is the product of all factors in the greatest number of their occurrence.

LCM = 222222233337771113

LCM = 2734731113

LCM = 508,540,032

The least common multiple of 1,664, 8,424, 8,918 and 4,004 is 508,540,032.

Why learn this

The least common multiple (LCM), sometimes called the lowest common multiple or least common divisor, is helpful for understanding the relationships between numbers. For example, if it takes Earth 365 days to orbit the sun and it takes Venus 225 days to orbit the sun and both are in perfect alignment at the time this scenario is given, how long will it take for Earth and Venus to align again? We can use LCM to determine that the answer would be 16,425 days.

LCM is also a very important part of many mathematical concepts that also have real-world applications. For example, we use LCMs when adding and subtracting fractions, which we use quite frequently.