LCM( 1651680, 1147 ) = 1651680
Step 1 : Write the given numbers in a horizontal line.
| 1651680 | 1147 |
Step 2 : Divide the given numbers by smallest prime number. In this example we can divide by 2.
(if any number is not divisible by 2, write it down unchanged)
| 2 | 1651680 | 1147 |
| 825840 | 1147 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
| 2 | 1651680 | 1147 |
| 2 | 825840 | 1147 |
| 2 | 412920 | 1147 |
| 2 | 206460 | 1147 |
| 2 | 103230 | 1147 |
| 3 | 51615 | 1147 |
| 3 | 17205 | 1147 |
| 5 | 5735 | 1147 |
| 31 | 1147 | 1147 |
| 37 | 37 | 37 |
| 1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1651680, 1147 ) = 2 · 2 · 2 · 2 · 2 · 3 · 3 · 5 · 31 · 37 = 1651680 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.