Find the LCM of 72, 8486 with the LCM of Two or More Numbers Calculator. Here we are teaching you two different methods through which you can calculate the LCM of 72, 8486. So, keep reading to learn more.
Given numbers are 72,8486
The least common multiple of numbers can be find using the prime factorization method or LCM formula.
The LCM of 72,8486 is 305496.
Find LCM of 72,8486 with Prime Factorization
| 2 | 72, 8486 |
| 36, 4243 |
Multiply the prime numbers at the bottom and the left side.
2 x 36 x 4243 = 305496
Therefore, the lowest common multiple of 72,8486 is 305496.
LCM formula is LCM(a1, a2, an) = (a1 x a2 x an)/{GCF(a1 x a2 x an) x common factors}
Firstly, we have to find the product of all the numbers.
72 x 8486 = 610992
Then, let us find the GCF of these five numbers. To do so, we have to list down the factors for each number and choose the highest factor that is in all of the lists.
72 : 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72
8486 : 1, 2, 4243, 8486
2 is the greatest number that appears in all the lists. Therefore, we can determine that the GCF of 72,8486, is 2.
Now, the common factors can be found like this.
72:2x 2x 2x 3x 3
8486:2x 4243
From this, we can see that the common factors because they appear for more than two numbers. So, just multiply them all together.
= 1
Therefore, the value for common factors is 1.
Now that we have all the elements of the formula, we can plug them in to calculate the LCM.
LCM(a1, a2, an) = (a1 x a2 x an)/{GCF(a1 x a2 x an) x common factors}
LCM = 610992/(2x1)
LCM = 610992/2
LCM = 305496
Thus, we can understand that the LCM of 72,8486 is 305496.
Here are some samples of LCM of two or more Numbers calculations.
1. What is the LCM of 72, 8486?
Answer: LCM of 72, 8486 is 305496.
2. How to calculate the LCM of 72, 8486?
The LCM can be found using two methods. You can either use the LCM formula or the prime factorization method to calculate the LCM of 72, 8486.
3. What is the LCM formula?
The LCM formula is LCM(a1, a2, an) = (a1 x a2 x an)/{GCF(a1 x a2 x an) x common factors}.