Calculators

Factorial

Compute n! — the product of every whole number from 1 to n. Supports 0 through 170 before the result exceeds a double-precision number.

Try it now

💡 Good to know: There are 52! ways to shuffle a deck — so many that virtually every well-shuffled deck in history is a brand-new, never-seen order.

Worked example

10!: 3,628,800

How it’s solved

Worked on the example above, step by step — follow along and you can do it on paper next time, no tool required.

n! (“n factorial”) multiplies together every whole number from 1 up to n.
Multiply 1 × 2 × … × n
1 × 2 × … × 10 = 3,628,800

Learn the method

Inputs

n (0–170)
10

Frequently asked

What is 10!?

3,628,800.

Why the 170 limit?

171! overflows the largest representable floating-point number, so the tool caps at 170.