Factorial Calculator (n!) Studio
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
Compute exact mathematical factorials (\(n!\)), double factorials (\(n!!\)), permutations (\(nPr\)), and combinations (\(nCr\)) with our Factorial Calculator! Powered by arbitrary-precision BigInt arithmetic, our tool computes exact multi-thousand-digit integers without floating-point overflow or scientific rounding errors.
How to Use
Key Features
Common Use Cases
Tips & Best Practices
Frequently Asked Questions
Q What is a Factorial (n!)?
The factorial of a non-negative integer n is the product of all positive integers less than or equal to n: n! = n × (n - 1) × (n - 2) × ... × 2 × 1. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120.
Q Why is 0! equal to 1?
0! = 1 by mathematical definition to preserve recursive identities like n! = n × (n - 1)!, which for n = 1 gives 1! = 1 × 0!, requiring 0! = 1. Combinatorially, there is exactly 1 way to arrange an empty set of zero items.
Q How do you count trailing zeros in a factorial using Legendre's Formula?
Trailing zeros are formed by pairs of 2s and 5s (since 2 × 5 = 10). Because factors of 2 are abundant, count factors of 5: Zeros = floor(n/5) + floor(n/25) + floor(n/125) + ... For 100!: floor(100/5) + floor(100/25) = 20 + 4 = 24 trailing zeros.



