Press 3! and the screen prints 6, press 5! and it prints 120 — the counting-down chain, 3 × 2 × 1 and 5 × 4 × 3 × 2 × 1. Press 0! and the answer is 1. That is not a special case glued on to keep the key from erroring: the recurrence is n! = n × (n−1)!, and at n = 1 it reads 1! = 1 × 0!, which only closes if 0! is 1. The ladder has to end somewhere, and 1 is where it ends.
The deeper reason is that 0! is counting something real: the number of ways to arrange nothing. There is exactly one such arrangement — the empty one — in the same sense in which there is exactly one function from the empty set to the empty set. The same convention is what makes 2⁰ = 1 rather than 0, and it is what keeps a binomial coefficient like (5 choose 0) equal to 1 instead of an undefined 0/0. Every formula that counts arrangements stays true at zero only because this one does.
Answer
1
How to read it
The workbench prints 1 for 0! — the same 1 that the step 1! = 1 × 0! needs.
Source
The empty product convention; 0! counts the permutations of an empty set, and the recurrence n! = n·(n−1)! forces the value
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.