LCM( 1763, 2301349680 ) = 2301349680
Step 1 : Write the given numbers in a horizontal line.
| 1763 | 2301349680 |
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 | 1763 | 2301349680 |
| 1763 | 1150674840 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
| 2 | 1763 | 2301349680 |
| 2 | 1763 | 1150674840 |
| 2 | 1763 | 575337420 |
| 2 | 1763 | 287668710 |
| 3 | 1763 | 143834355 |
| 3 | 1763 | 47944785 |
| 5 | 1763 | 15981595 |
| 7 | 1763 | 3196319 |
| 7 | 1763 | 456617 |
| 37 | 1763 | 65231 |
| 41 | 1763 | 1763 |
| 43 | 43 | 43 |
| 1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1763, 2301349680 ) = 2 · 2 · 2 · 2 · 3 · 3 · 5 · 7 · 7 · 37 · 41 · 43 = 2301349680 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.