From the first statement we can say that the number of coconuts in the heap should be divided by 2 3 and 5 so that every single coconut will be divided and there will be no left over coconut in the heap.
So the answer will be L.C.M= 2*3*5=30.
The least number of coconut in the heap is 30. That can be divider in groups of 2 3 or 5. And also no left over.