Eleven different letters can be ordered 11! ways, and the workbench prints that as 3.99168⋅10+7 — 39,916,800, shown with an exponent because the screen switches to scientific notation at 100 000. MISSISSIPPI has only four kinds of letter, so most of those orders are the same word written again: swapping the four S among themselves gives 4! identical arrangements, the four P give another 4! and the two I give 2!. Divide 39,916,800 by 4!·4!·2! = 1152 and the screen answers 34650, the number of distinguishable arrangements.
Nothing about the division is an approximation, which is the point of doing it this way: 39,916,800/1152 is exact because every arrangement is counted 4!·4!·2! times and no arrangement is counted twice. The same formula with the letters of a word that has no repeats — seventeen distinct letters, say — returns to straight factorials, and the ratio between the two answers is entirely the repetition. This is why the multinomial coefficient, not the factorial, is the one that appears in the expansion of (a + b + c)ⁿ.
Answer
34650
How to read it
11!/(4!·4!·2!) on the workbench. The second link is the numerator alone, 11!, and the third is the denominator 4!·4!·2! = 1152.
Source
The multinomial coefficient 11!/(4!·4!·2!) for the letter counts of MISSISSIPPI, the standard worked example of the multinomial theorem n!/(n₁!·n₂!·…·nₖ!) in any first course in combinatorics
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.