LCM( 1766, 181191600 ) = 181191600
Step 1 : Write the given numbers in a horizontal line.
| 1766 | 181191600 |
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 | 1766 | 181191600 |
| 883 | 90595800 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
| 2 | 1766 | 181191600 |
| 2 | 883 | 90595800 |
| 2 | 883 | 45297900 |
| 2 | 883 | 22648950 |
| 3 | 883 | 11324475 |
| 3 | 883 | 3774825 |
| 3 | 883 | 1258275 |
| 5 | 883 | 419425 |
| 5 | 883 | 83885 |
| 19 | 883 | 16777 |
| 883 | 883 | 883 |
| 1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1766, 181191600 ) = 2 · 2 · 2 · 2 · 3 · 3 · 3 · 5 · 5 · 19 · 883 = 181191600 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.