When Sandra sorts the Binky babies in he collection into piles of 2 3 4 or 5 the is always one left what is the smallest number of Binky babies she can have?

To find the smallest number of Binky babies Sandra can have, we need a number that leaves a remainder of 1 when divided by 2, 3, 4, and 5. The least common multiple (LCM) of 2, 3, 4, and 5 is 60. Therefore, the smallest number of Binky babies that leaves a remainder of 1 when divided by these numbers is 60 + 1, which is 61. Thus, Sandra must have at least 61 Binky babies.