Factorial Calculator
Reviewed by Hamza Gujjar, Algorithm Architect & Software Developer
Last updated: August 17, 2026Combinatorics, Permutation Probability, and Factorial Mathematical Modeling
In discrete combinatorics, probability theory, statistical mechanics, polynomial Taylor series expansions, and computer algorithm design, the factorial of a non-negative integer n (denoted as n!) is the product of all positive integers less than or equal to n: n! = n × (n−1) × (n−2) × ... × 2 × 1. Factorials grow with staggering, super-exponential speed: while 5! = 120, jumping to 10! yields 3,628,800, and 20! reaches 2,432,902,008,176,640,000 (2.43 × 10^18). The Factorial Calculator computes exact integer factorials, evaluates permutations (nPr) and combinations (nCr), calculates asymptotic approximations via Stirling's Formula, models non-integer factorials via Euler's Gamma Function (Γ(z)), and evaluates subfactorials (derangements).
A central convention in combinatorics is Zero Factorial (0! = 1). Defining 0! = 1 is mathematically essential for the consistency of combinatorial formulas: the number of ways to arrange zero items from an empty set is exactly 1 way. Furthermore, it satisfies the fundamental recursive factorial identity: n! = n × (n−1)! ⇒ 1! = 1 × 0! ⇒ 1 = 1 × 0! ⇒ 0! = 1. In advanced mathematics, factorials are extended to continuous and complex numbers via Euler's Gamma Function: Γ(n+1) = n!.
Core Factorial Formulas and Combinatorial Identities
n! = n × ( n − 1 ) × ( n − 2 ) × ... × 2 × 1 (with 0! = 1)
2. Recursive Factorial Identity:
n! = n × ( n − 1 )! — and — ( n − 1 )! = n! / n
3. Stirling's Asymptotic Approximation Formula:
n! ≈ √[ 2 × Ï€ × n ] × ( n / e )^n × [ 1 + 1 / ( 12n ) ]
(Enables rapid, high-precision calculation of astronomical factorials like 100! or 1,000!).
4. Permutations Formula (Order Matters):
P(n, r) = n! / ( n − r )!
5. Combinations / Binomial Coefficient Formula (Order Does NOT Matter):
C(n, r) = n! / [ r! × ( n − r )! ]
6. Euler's Gamma Function for Half-Integers:
Γ( 1/2 ) = √π ⇒ ( 1/2 )! = √π / 2 ≈ 0.886227
Factorial Growth and Permutation Reference Table (n = 0 to 12)
| n | n! Exact Value | Scientific Notation | Combinatorial Permutation Application | Stirling Approximation Error |
|---|---|---|---|---|
| 0 | 1 | 1.000 × 10^0 | Empty set permutation, 0! = 1 definition | N/A |
| 1 | 1 | 1.000 × 10^0 | Arranging 1 item in 1 slot | < 0.8% |
| 2 | 2 | 2.000 × 10^0 | Flipping 2 distinct coins in order | < 0.4% |
| 3 | 6 | 6.000 × 10^0 | Arranging 3 books on a shelf (3×2×1) | < 0.28% |
| 4 | 24 | 2.400 × 10^1 | 4-digit PIN code unique permutations | < 0.21% |
| 5 | 120 | 1.200 × 10^2 | Arranging 5 sprint runners at starting blocks | < 0.17% |
| 6 | 720 | 7.200 × 10^2 | 6-sided die ordering permutations | < 0.14% |
| 7 | 5,040 | 5.040 × 10^3 | 7 days of week schedule ordering | < 0.12% |
| 8 | 40,320 | 4.032 × 10^4 | Chess rank piece placements | < 0.10% |
| 10 | 3,628,800 | 3.629 × 10^6 | 10-player baseball batting lineup orderings | < 0.08% |
| 12 | 479,001,600 | 4.790 × 10^8 | 12 months of year permutation schedules | < 0.07% |
Case Study: The Mind-Bending Permutations of a 52-Card Deck
Combinatorial Card Shuffling: How many distinct possible arrangements exist when shuffling a standard 52-card deck of playing cards (52!)? Compare this number against the physical number of atoms in our observable galaxy.
1. Calculate 52 Factorial (52!):
52! ≈ 8.0658175 × 10^67 Possible Card Orderings!
(Exact value = 80,658,175,170,943,878,571,660,636,856,403,766,975,289,505,440,883,277,824,000,000,000,000).
2. Astounding Physical Perspective:
8.06 × 10^67 is so unimaginably vast that every time you thoroughly shuffle a deck of cards, that exact sequence of 52 cards has almost certainly never existed before in the entire history of the universe — exceeding the total number of seconds since the Big Bang (4.3 × 10^17 seconds) multiplied by trillions!
Frequently Asked Questions
Why is 0! (Zero Factorial) equal to 1 instead of 0?
By the recursive identity, n! = n × (n−1)!. Substituting n=1: 1! = 1 × (1−1)! ⇒ 1 = 1 × 0! ⇒ 0! = 1. In combinatorics, 0! represents the number of ways to arrange zero items, which is exactly 1 way (the empty set).
What is a Subfactorial / Derangement (!n)?
A Derangement (!n) is a permutation of n items where no item appears in its original position (e.g. Secret Santa gift exchange where nobody draws their own name): !n = n! × [ 1/0! − 1/1! + 1/2! − 1/3! + ... + (−1)^n / n! ] ≈ n! / e.
Why do factorials overflow 64-bit integer computer variables?
Standard 64-bit unsigned integers (uint64) have a maximum value of 2^64 − 1 ≈ 1.84 × 10^19. Because 20! ≈ 2.43 × 10^18 and 21! ≈ 5.11 × 10^19, calculating 21! in standard C++/Java integer types causes Arithmetic Overflow, requiring BigInteger arbitrary-precision libraries.
What is the Double Factorial (n!!)?
The Double Factorial (n!!) is the product of only integers having the same parity (odd or even) as n: for odd n, 7!! = 7 × 5 × 3 × 1 = 105; for even n, 8!! = 8 × 6 × 4 × 2 = 384.
Taylor and Maclaurin Series Expansions in Calculus
In mathematical analysis and scientific computing, transcendental functions (exponential, trigonometric) are evaluated via infinite polynomial power series with factorials in the denominators:
• e^x = ∑_(n=0)^∞ [ x^n / n! ] = 1 + x + x^2/2! + x^3/3! + x^4/4! + ...
• sin(x) = ∑_(n=0)^∞ [ (−1)^n × x^(2n+1) / (2n+1)! ] = x − x^3/6 + x^5/120 − x^7/5040 + ...
• cos(x) = ∑_(n=0)^∞ [ (−1)^n × x^(2n) / (2n)! ] = 1 − x^2/2 + x^4/24 − x^6/720 + ...
Because factorials grow super-exponentially, the denominators explode rapidly, causing Taylor series to converge with breathtaking speed on computer CPU floating-point units.
Wilson's Theorem in Number Theory and Prime Number Testing
In theoretical number theory (John Wilson / Joseph-Louis Lagrange, 1771), factorials provide a definitive mathematical criterion for primality: an integer p > 1 is a Prime Number if and only if (p − 1)! ≡ −1 (mod p).
Conclusion: The Fascinating Universe of Combinatorial Factorials
The Factorial Calculator provides mathematicians, software engineers, and probability students with a powerful computational model. By evaluating exact factorials, calculating permutations and combinations, and modeling Stirling's asymptotic approximations, the calculator unlocks the fascinating mathematics of permutations and discrete arrangements.
Euler's Gamma Function: Extending Factorials to Real and Complex Numbers
In mathematical physics (Leonhard Euler, 1729), the discrete integer factorial operation is extended to continuous real and complex numbers via the improper Gamma Function Integral:
Γ( z ) = ∫_(0)^(∞) [ t^(z−1) × e^(−t) dt ] (for Re(z) > 0)
Fundamental Recurrence: Γ( z + 1 ) = z × Γ( z ) ⇒ Γ( n + 1 ) = n! (for integers n).
Evaluating the Gaussian integral yields the celebrated half-integer factorial identity: Γ(1/2) = √π ⇒ (1/2)! = √π / 2 ≈ 0.886227 — crucial for calculating surface areas of n-dimensional hyperspheres in statistical mechanics.
Binomial Theorem and Combinatorial Pascal's Triangle
In polynomial algebra (Isaac Newton, 1665), expanding binomial powers utilizes factorial coefficients: (x + y)^n = ∑_(k=0)^n [ ( n! / ( k! × (n−k)! ) ) × x^(n−k) × y^k ] — matching the entries of Pascal's Triangle.
Subfactorials and Derangements: The Hat-Check Problem
In combinatorial probability theory (Pierre Raymond de Montmort, 1708), calculating the probability that nobody receives their own hat in a random hat check of n people uses Derangements (!n):
!n = n! × ∑_(k=0)^n [ (−1)^k / k! ]
As n approaches infinity: Probability(Derangement) = !n / n! → 1 / e ≈ 0.367879 (36.79%).
Regardless of whether there are 10, 100, or 1,000,000 people, the probability that zero people get their own hat is always precisely 36.79% — governed by Euler's constant e!
Prime Factorization of Factorials: Legendre's Formula
In analytic number theory (Adrien-Marie Legendre, 1808), calculating the exact exponent of a prime p dividing n! utilizes Legendre's Formula: E_p(n!) = ∑_(k=1)^∞ ⌊ n / p^k ⌋ — allowing mathematicians to compute trailing zeros of 100! (exactly 24 zeros) instantly without multiplying the huge number.
Common Pitfalls in Factorial Calculations and Combinatorial Permutations
Prevent combinatorial calculation errors and master permutation mathematics with these guidelines:
- Assuming (n + m)! = n! + m!: Factorials do not distribute over addition — (2 + 3)! = 5! = 120, whereas 2! + 3! = 2 + 6 = 8!
- Confusing Permutations (Order Matters) with Combinations (Order Does Not Matter): Choosing a 3-person committee uses Combinations C(n,k); awarding 1st, 2nd, and 3rd place prizes uses Permutations P(n,k).
- Ignoring 64-Bit Integer Overflow in Software: Any factorial n ≥ 21 overflows standard 64-bit integers in computer programming.
Factorial and Combinatorial Calculation Checklist
Execute factorial and combinatorial calculations with complete mathematical accuracy using this checklist:
- Verify Non-Negative Integer Domain (n ≥ 0 with 0! = 1): Ensure valid inputs.
- Use Stirling's Approximation for Astronomical Values (n > 20): n! ≈ √[2Ï€n] × (n/e)^n.
- Apply the Permutation Formula When Sequence Order Matters: P(n,r) = n! / (n−r)!.
- Apply the Combination Formula for Unordered Subsets: C(n,r) = n! / [r!(n−r)!].
The Gamma Function and the Volume of N-Dimensional Hyperspheres
In theoretical geometry and statistical mechanics, calculating the exact spatial volume of an n-dimensional hypersphere of radius R utilizes Euler's Gamma Function (continuous factorial):
Volume_n( R ) = [ π^(n/2) / Γ( n/2 + 1 ) ] × R^n
• For n = 2 (Circle Area): π^1 / Γ(2) × R^2 = π / 1! × R^2 = π·R^2.
• For n = 3 (Sphere Volume): π^(3/2) / Γ(5/2) × R^3 = π^(3/2) / [ (3/4)√π ] × R^3 = (4/3)π·R^3.
Continuous factorial mathematics provides the unified geometric framework that calculates higher-dimensional physical spaces in string theory and quantum field theory.
Combinatorial Partitions and Young Tableaux in Quantum Physics
In quantum group theory and particle physics (representation theory of the symmetric group S_n), factorials calculate dimensions of irreducible representations via the Hook-Length Formula — governing electron spin states in quantum atomic shells.
The Traveling Salesperson Problem (TSP) and Factorial NP-Hard Complexity
In combinatorial optimization and computer algorithm design, finding the shortest round-trip route visiting n cities is the classic Traveling Salesperson Problem (TSP):
Total_Possible_Routes = ( n − 1 )! / 2
• For 10 Cities: 9! / 2 = 181,440 Routes (Solvable in milliseconds)
• For 20 Cities: 19! / 2 ≈ 6.08 × 10^16 Routes (Would take modern supercomputers centuries to brute-force!).
Because factorial scaling rapidly exceeds physical computational limits, logistics algorithms (FedEx, UPS route planning) deploy genetic heuristics and simulated annealing rather than brute-force factorial evaluation.
Statistical Mechanics: Maxwell-Boltzmann Particle Microstates
In thermodynamic statistical physics (Ludwig Boltzmann, 1877), the entropy of an ideal gas is defined by the number of distinct microscopic molecular arrangements (microstates W): S = k_B × ln( W ) where W = N! / [ ∠( N_i! ) ] — connecting microscopic factorial combinatorics directly with macroscopic thermodynamic temperature and heat.
Combinatorial Genomics: Sequence Alignment and Factorial Search Trees
In bioinformatics and computational genomics (BLAST sequence alignment algorithms), comparing DNA nucleotide sequences across multi-gene gene families involves analyzing combinatorial factorial search trees: using dynamic programming (Needleman-Wunsch) to avoid factorial combinatorial explosion.
Summary: The Staggering Combinatorial Beauty of Factorials
Factorials reveal the boundless richness of discrete arrangements, permutations, and probability. From card shuffling permutations to statistical thermodynamics and infinite Taylor series, factorials provide the essential mathematical language for counting the universe.
Use the Factorial Calculator for all your permutation, combination, and combinatorial calculations.
Quantum Chemistry: Slater Determinants and Antisymmetric Wavefunctions
In quantum electronic structure theory (John C. Slater, 1929), multi-electron wavefunctions must satisfy the Pauli Exclusion Principle: constructed as Slater Determinants with a 1/√[N!] normalization prefactor — preventing electron collapse and determining the chemical periodic table of elements.
The Factorial Calculator provides exact mathematical models for all your permutation and combinatorial needs.
Quantum Statistical Mechanics: Bose-Einstein and Fermi-Dirac Distributions
In quantum thermodynamics (Satyendra Nath Bose / Albert Einstein / Enrico Fermi), calculating microstate permutations for indistinguishable subatomic bosons and fermions incorporates factorial permutation terms (W = ∠[ ( g_i + n_i − 1 )! / ( n_i! × (g_i−1)! ) ]) — modeling supercooling Bose-Einstein condensates.
Combinatorial Permutations: Rubik's Cube State Space Complexity
In group theory and combinatorial mathematics (Ernő Rubik, 1974), a standard 3×3×3 Rubik's Cube has exactly ( 8! × 3^7 × 12! × 2^11 ) / 2 ≈ 4.3252 × 10^19 reachable permutations — all solvable in 20 moves or fewer (God's Number).
Combinatorial Permutations: Chess Game Tree Complexity (Shannon Number)
In theoretical game theory and artificial intelligence (Claude Shannon, 1950), the total number of unique chess game permutations is estimated by the Shannon Number: 10^120 possible chess games — far exceeding the number of atoms in the observable universe.
Combinatorial Permutations: DNA Genetic Code Codon Degeneracy
In molecular biology and genetics (Francis Crick, 1961), 4 distinct nucleotide RNA bases (A, U, C, G) arranged in 3-letter triplet codons generate 4^3 = 64 possible codon combinations: translating into 20 standard amino acids and 3 stop signals with built-in evolutionary error tolerance.
Combinatorial Permutations: The Enigma Machine Cryptographic Key Space
In military historical cryptography (World War II Bletchley Park / Alan Turing), the German military Enigma cipher machine achieved astronomical permutation complexities through 3 interchangeable rotors (3! = 6 orderings), 26 ring settings, and a 10-pair plugboard generating 158,962,555,217,826,360,000 unique key settings.
Combinatorial Permutations: Card Deck Poker Hand Combinations
In probability theory and game mathematics, calculating the total number of distinct 5-card poker hands from a 52-card deck uses binomial combinations: C(52, 5) = 52! / [ 5! × 47! ] = 2,598,960 unique poker hands (including exactly 4 Royal Flushes with probability 0.000154%).
Combinatorial Permutations: Secret Santa Derangement Probability (1/e)
In recreational mathematics and holiday gift exchanges of n participants, the probability that zero people draw their own name converges rapidly to exactly 1/e (approx. 36.7879%) for all group sizes n ≥ 4 — governed by subfactorials.
Combinatorial Permutations: Prime Factorial Primorials (p#)
In analytic number theory, the Primorial (p#) is the product of all prime numbers less than or equal to p (e.g. 7# = 7 × 5 × 3 × 2 = 210): used in Euclid's classical proof of the infinitude of prime numbers.
Combinatorial Permutations: Multifactorial Functions (Triple Factorial n!!!)
In advanced combinatorics, Multifactorial Functions (n!^(k)) multiply integers with step size k (e.g. triple factorial 9!!! = 9 × 6 × 3 = 162): modeling specialized lattice path configurations in mathematical statistical mechanics.
Combinatorial Permutations: Permutation Inversion Count Algorithms
In theoretical computer science and sorting algorithms, the number of inverted pairs in a sequence of n elements measures how out-of-order the list is: ranging from 0 inversions (sorted) up to n(n−1)/2 inversions (completely reversed) — governing Bubble Sort and Insertion Sort O(n^2) runtime complexity.
Combinatorial Permutations: Determinant Matrix Expansions (Leibniz Formula)
In linear algebra and matrix mathematics (Gottfried Wilhelm Leibniz, 1693), the determinant of an n×n matrix is computed by summing across all n! permutations of matrix entries: det(A) = ∑_( σ ∈ S_n ) [ sgn(σ) × âˆ_(i=1)^n a_(i, σ(i)) ].
Combinatorial Permutations: Sieve of Eratosthenes and Factorial Bounds
In analytic prime number distribution theory, factorial products define composite number sequences of arbitrary length: for any integer n, the sequence of n consecutive integers (n+1)! + 2, (n+1)! + 3, ..., (n+1)! + (n+1) contains zero prime numbers — proving prime gaps can be arbitrarily vast.
Combinatorial Permutations: The Birthday Paradox Probability Formula
In probability theory and cryptographic collision attacks, calculating the probability that at least two people in a group of n individuals share a birthday uses factorials: P(match) = 1 − [ 365! / ( (365−n)! × 365^n ) ] > 50% for only n = 23 people!
Combinatorial Permutations: Card Deck Bridge Hand Combinations
In probability mathematics and contract bridge game theory, calculating the total number of distinct 13-card bridge hands dealt from a 52-card deck utilizes combinations: C(52, 13) = 52! / [ 13! × 39! ] = 635,013,559,600 unique bridge hands.
Combinatorial Permutations: Card Deck Euchre and Pinochle Hand Permutations
In traditional card game combinatorics, stripped-deck games (24-card Euchre or 48-card Pinochle) exhibit distinct factorial combinations: calculating trump suit distribution probabilities across 5-card hands (C(24,5) = 42,504 hands) to formulate optimal bidding strategies.
Combinatorial Permutations: Card Deck Bridge Deal Permutations
In contract bridge probability theory, the total number of unique ways to distribute a 52-card deck among 4 players (13 cards each) is given by the multinomial coefficient: 52! / ( 13! × 13! × 13! × 13! ) ≈ 5.3645 × 10^28 unique deals.
Combinatorial Permutations: Card Deck Gin Rummy Hand Combinations
In card game probability mathematics, analyzing 10-card Gin Rummy hands from a 52-card deck utilizes combinations: C(52, 10) = 52! / [ 10! × 42! ] = 15,820,024,220 unique 10-card hands — calculating exact probabilities of matching meld sets and sequences.
Combinatorial Permutations: Card Deck Cribbage Hand Combinations
In traditional card combinatorics and probability theory, evaluating 6-card Cribbage hands from a 52-card deck utilizes combinations: C(52, 6) = 52! / [ 6! × 46! ] = 20,358,520 unique 6-card hands — calculating exact probabilities of matching point-scoring runs, pairs, and fifteen combinations.
Combinatorial Permutations: Card Deck Hearts and Spades Hand Permutations
In traditional 4-player trick-taking card games (Hearts, Spades), calculating suit distribution probabilities across 13-card hands uses multinomial factorial combinations: evaluating void and singleton probabilities to execute game-winning card leads.
Combinatorial Permutations: Card Deck Poker Hand Permutations
In card game combinatorics, calculating exact probabilities of specific 5-card combinations (e.g. Full House C(13,1)×C(4,3)×C(12,1)×C(4,2) = 3,744 combinations) enables poker game theory optimal (GTO) strategy modeling.
Combinatorial Permutations: Card Deck Bridge Deal Permutations and Tournament Play
In international contract bridge tournaments (duplicate bridge), dealing identical computer-generated card deals across multiple tables tests player skill against identical probability distributions — eliminating luck and celebrating pure strategic card play.
Combinatorial Permutations: Card Deck Gin Rummy Hand Combinations and Melds
In card game combinatorics, calculating exact probabilities of matching specific 10-card Gin Rummy deadwood counts and gin hands enables optimal algorithmic gameplay modeling and computerized tournament analysis.
Combinatorial Permutations: Card Deck Euchre and Pinochle Hand Permutations and Melds
In traditional card combinatorics and probability theory, evaluating stripped-deck card distributions enables optimal card counting, computerized tournament game analysis, and mathematical game theory strategy development.
Combinatorial Permutations: Card Deck Bridge Deal Permutations and Strategy Analysis
In contract bridge probability theory, analyzing multi-hand card distributions enables optimal card counting, computerized tournament game analysis, and mathematical game theory strategy development across competitive duplicate bridge events.
Combinatorial Permutations: Card Deck Hearts and Spades Tournament Combinations
In competitive trick-taking card tournaments, evaluating multi-hand card distributions enables optimal card counting, computerized tournament game analysis, and mathematical game theory strategy development across competitive duplicate trick-taking events.
Mastering factorials unlocks the incredible power of permutations, probability theory, and discrete combinatorial mathematics.
The Factorial Calculator delivers fast, exact solutions for all your factorial, permutation, and combination calculations with complete precision.
Calculate your factorials with complete precision and empower your calculations today.