I want to master my skills in elementary combinatorics so trying to solve the following problem: Calculate sum of all $10$-digit numbers obtained from all possible permutations of $\{4,5,5,6,6,6,7,7,7,7\}$.
Please check my solution.
How many times does each number from the list appears in every digit? (English is not my native language so I'm afraid of using wrong terminology, by digits here I mean units, dozens, hundreds, thousands and so on in decimal representation) For $4$ it $9!$ times since when we fix it somewhere we are free to vary all other positions and there are $9!$ such possibilities. Similarly for $5$ we have $2\cdot9!$ because of there are two $5$'s in our list, for $6$ there are $3\cdot9!$ and $7$ appears $4\cdot9!$ times in each digit.
What is the sum of all such numbers restricted to particular digit? It is $4\cdot1\cdot9! + 5\cdot2\cdot9! + 6\cdot3\cdot9! + 7\cdot4\cdot9! = 21772800$.
Now we are ready to calculate the final answer by sum in all digits: $\sum\limits_{i=0}^{9} 21772800\cdot 10^i = 24191999997580800$.
Am I right or are there any mistakes?