Anonymous appears to be correct except that there are 13 letters.
(Unless I can't count which is always a possibility)
NumberofPermutationsis$13!2!2!2!$
13!(2×2×2)=778377600
I am never overly confident about these so I used this site for reference.
http://www.regentsprep.org/regents/math/algebra/apr2/LpermRep.htm
So we have the word "combinatorics" which can be rearranged to get abcciimnoorts. It is a 12 letter word so we start with 12! which is 479001600 although this assumes all the double letters are unique. We then need to divide by the total number of permutations of the double letters c, I, and o. The total number for this is 2!2!2! which is 8, and so we get 479001600/8 which becomes 59875200.
Anonymous appears to be correct except that there are 13 letters.
(Unless I can't count which is always a possibility)
NumberofPermutationsis$13!2!2!2!$
13!(2×2×2)=778377600
I am never overly confident about these so I used this site for reference.
http://www.regentsprep.org/regents/math/algebra/apr2/LpermRep.htm