I'm not 100% I understand the question correctly, but the way I read it:
We have a number, t, that has factors: 2*a*c, a*b, and a*b*c. And we want to know what the smallest number of potential integers t could be divisible by. We also know a, b, and c are prime.
To solve this problem, I am going to assume that t is equal to a*b*c. Since a*b*c is the largest of the factors above, we'll assume this is the largest factor. The second assumption I'll make is that one of the three variables is equal to 2. We only know that a, b, and c are different prime numbers. They don't necessarily have to be different than another factor we already know about.
If we make those assumptions, listing the factors is equal to listing all the combinations of a, b, and c:
1, a, b, c, ab, bc, ac, abc
So the answer is (hopefully) equal to 8
OA?
Taking the GMAT Again...PhD this time!
October 2008 Score: GMAT - 750 (50 Q, 41 V)
Manhattan GMAT 1 - 11/20/11 - 750 (50 Q, 42 V)
Manhattan GMAT 2 - 12/3/11 - 780 (51 Q, 45 V)