Factorial Calculator
n! = 1×2×3×...×n
Detailed Guide Coming Soon
We're working on a comprehensive educational guide for the Factorial Calculator n! in your language. The content below is shown in English.
Proffstips
Stirling's approximation: n! ≈ √(2πn) × (n/e)ⁿ. For large n, this is very accurate. For n=10: exact = 3,628,800; Stirling gives 3,598,696 (0.83% error).
Visste du?
The number of ways to shuffle a standard 52-card deck is 52! ≈ 8 × 10⁶⁷. This number is so large that every time you shuffle a deck, you are almost certainly creating an ordering that has never existed before in human history.
Har du en fråga om den här kalkylatorn? Få ett detaljerat svar.
Variabelbeskrivning
Definition
Product of all positive integers from 1 to n.
Recursive definition
Each factorial is n times the previous.
Stirling's approximation
Accurate estimate for large n.
Read the full guide on how to use this calculator effectively
Läs mer →Få mattetips varje vecka
Gå med 12 000+ prenumeranter som får räknartips varje vecka.