Distinguishable Permutation Problem?

This problem is very vague. A social security number is a sequence of nine digits. How many different social security numbers are possible in which there are some repetitions of digits. The answer is 996,371,200. I just have no idea how it was solved. Any help is appreciated.