LCM of 1152 and 1664 is 14976
LCM, abbreviation for least common multiple, is defined as the smallest number that is the product of two or more numbers 1152 and 1664
Hence, LCM of 1152 and 1664 is 14976.
2 | 1152 1664 |
2 | 576 832 |
2 | 288 416 |
2 | 144 208 |
2 | 72 104 |
2 | 36 52 |
2 | 18 26 |
3 | 9 13 |
3 | 3 13 |
13 | 1 13 |
1 1 |
Hence, LCM of 1152 and 1664 is 2 x 2 x 2 x 2 x 2 x 2 x 2 x 3 x 3 x 13 = 14976.
Hence, LCM of 1152 and 1664 is 14976.
Franky and Joy are running on a circular track. They take 1152 and 1664 minutes respectively to go round once. We need to find out at what time (minimum) they will run together again. For this we need to find the LCM of 1152 and 1664.So, LCM of 1152 and 1664 is 14976.
The least number of candies and chocolates Annie should buy so that there will be one candy for each chocolate we need to find the lcm of 1152 and 1664.So, LCM of 1152 and 1664 is 14976.
Given that the cricket team plays every 1152 days and the basketball team plays every 1664 days, so for finding the next time when both teams will play again we need to find the LCM of 1152 and 1664.So, LCM of 1152 and 1664 is 14976.
To find the least number of textbooks that each company could have printed we need to find the LCM of 1152 and 1664.So, LCM of 1152 and 1664 is 14976.
The problem can be solved using LCM, because we are trying to figure out the least time until they excercise together again.So, LCM of 1152 and 1664 is 14976.
Greatest common factors or gcf of 1152 and 1664 is GCF(1152, 1664) * LCM(1152, 1664) = (1152 x 1664) / GCF(1152, 1664) = 14976.
Least number which is exactly divisible by 1152 and 1664 is 14976.