Let k∈{1,2,…,2010}. If 3∣k, then k∤52010!−32010!. Also, if 5∣k, then k∤52010!−32010!. It follows that any multiple of 3 or 5 in the set {1,2,…,2010} is not a divisor of 52010!−32010!. Any number k in {1,2,…,2010} which is not divisible by 3 or 5 is also a divisor of 52010!−32010!. We have φ(k)<k<2010, and from Euler's Theorem we get
52010!−32010!=aφ(k)−bφ(k)≡1−1(modk).
The desired number is
2010−[32010]−[52010]+[152010]=1072.