Factorial Calculator (n!) with Expressions & Permutations
Step-by-Step Breakdown • Expressions Solver • Permutations & Combinations
Factorial & Expression Solver
Calculate exact factorials, solve equations (e.g. 5! + 3! or 10!/5!), or use the slider
Step-by-Step Multiplication
Mathematical Presets & Benchmarks
Quickly load specific mathematical constants, arrangements, and combinatorics limits
Arrangements (nPr) & Selections (nCr)
Calculate probabilities, permutations, and choices using optimized overflow-proof algorithms
Stirling's Approximation Studio
Estimate giant factorials up to 10,000! and track mathematical error tolerances
Error Matrix (Exact vs Stirling)
| Target Factorial: | 5! |
| Exact Value: | 120 |
| Stirling's Estimate: | 1.180 × 10^2 |
| Absolute Error: | 1.98 |
| Relative Margin: | 1.6500% |
Recent Tape Calculations
Factorial Reference Chart (n! Quick Guide)
Instant numerical guides for small and landmark factorial inputs
| Input (n) | Factorial Notation (n!) | Exact Value / Decimal Form |
|---|---|---|
| 1 | 1! | 1 |
| 2 | 2! | 2 |
| 3 | 3! | 6 |
| 4 | 4! | 24 |
| 5 | 5! | 120 |
| 6 | 6! | 720 |
| 7 | 7! | 5,040 |
| 8 | 8! | 40,320 |
| 9 | 9! | 362,880 |
| 10 | 10! | 3,628,800 |
| 11 | 11! | 3.992 × 10^7 |
| 12 | 12! | 4.790 × 10^8 |
| 13 | 13! | 6.227 × 10^9 |
| 14 | 14! | 8.718 × 10^10 |
| 15 | 15! | 1.308 × 10^12 |
| 20 | 20! | 2.433 × 10^18 |
| 25 | 25! | 1.551 × 10^25 |
| 30 | 30! | 2.653 × 10^32 |
| 50 | 50! | 3.041 × 10^64 |
| 100 | 100! | 9.333 × 10^157 |
| 170 | 170! | 7.257 × 10^306 |
Overview & Capabilities
Calculate factorials (n!), permutations (nPr), and combinations (nCr) with our advanced calculator. Features step-by-step breakdowns, expression parsing, visual growth charts, and calculation history for easy understanding of factorial mathematics.
How to Use
Key Features
Common Use Cases
Tips & Best Practices
Frequently Asked Questions
Q What is a factorial, and how is n! calculated?
A factorial (denoted as n!) is the product of all positive integers less than or equal to n. For example: 5! = 5 × 4 × 3 × 2 × 1 = 120. It represents the number of ways to arrange n distinct objects.
Q Why does 0 factorial (0!) equal 1?
By mathematical definition, 0! = 1. This is consistent with combinatorics formulas (there is exactly 1 way to arrange 0 items: doing nothing) and the recursive relationship n! = n × (n-1)!, which for n=1 yields 1! = 1 × 0!, meaning 0! must equal 1.
Q What is the difference between permutations (nPr) and combinations (nCr)?
Permutations (nPr) count arrangements where the order matters (e.g. race podium finishes: 1st, 2nd, 3rd). Combinations (nCr) count selections where the order does not matter (e.g. choosing 5 lottery numbers). nPr = n! / (n-r)! and nCr = n! / (r! × (n-r)!).
Q What is Stirling's Approximation and when is it used?
Stirling's Approximation is an analytical formula used to estimate factorials: n! ≈ sqrt(2 × π × n) × (n / e)^n. It is extremely useful in physics, probability, and computer science for calculating huge factorials where exact multiplication is computationally expensive or overflows standard numerical types.
Q Why does a standard calculator throw an error for factorials above 170?
Computers use the IEEE 754 double-precision floating-point format to store large decimal values. This format has a maximum value limit of approximately 1.79 × 10^308. Since 170! is about 7.26 × 10^306 and 171! is 1.24 × 10^309, any factorial higher than 170 overflows this hardware limit and is represented as Infinity.

