math calculator

Gamma Function & Large Factorial Calculator

Calculate factorials of large numbers and evaluate the Gamma function for real and fractional inputs with this free calculator.

Formula Verified by Dr. Elena Rostova, PhD

Quick actions: Save inputs, view saved runs, print, share, or export results

Saved Runs

Inputs

Calculation Mode

Integer n (0 – 170)

Results

10! (Factorial)

3,628,800

Stirling's Approximation3.5987e+6

Number of Digits7

Γ(n+1) Confirmation3628800.000

Factorial Growth Chart

Factorial growth (log₁₀ scale) for n = 1 to 10

Step-by-Step Derivation

Calculate \(10!\) using the recurrence \(n! = n \times (n-1)!\):

\[10! = 2 \times 3 \times 4 \times 5 \times 6 \times 7 \times 8 \times 9 \times 10 = 3,628,800\]

Stirling's Approximation: \[10! \approx \sqrt{2\pi \times 10} \times \left(\frac{10}{e}\right)^{10} \approx 3.5987e+6\]

Relative error: \[\frac{|3.629e+6 - 3.599e+6|}{3.629e+6} \approx 0.830\%\]

Gamma function relation: \[\Gamma(11) = 10! = 3,628,800\]

Tip

Save this calculator to support your complex probability modeling, statistical analysis, and theoretical mathematical computations.

Formula

Factorial and Gamma Function Formulas

n! = n \times (n-1)!, \quad \Gamma(z) = \int_0^{\infty} t^{z-1}e^{-t}\,dt, \quad \Gamma(n+1)=n!

The factorial counts arrangements of n distinct items. The Gamma function extends this to all real and complex numbers using an integral definition.

Step by step

How the calculation works

1Use Integer Factorial mode to calculate n! for any integer up to 170.
2Use Gamma Function mode to evaluate Γ(z) for any positive real number.
3Stirling's Approximation is shown for large n to demonstrate asymptotic growth.

Related guides

Learn more about this calculation

Guide

Scientific Notation Guide: Powers of Ten Made Practical

Learn how to convert, compare, and calculate with powers of ten using worked examples and the live DTC scientific calculator.

Site Guide

How to Use Do The Calculation Calculators: A Practical Step-by-Step Guide

Learn the fastest reliable workflow for using Do The Calculation calculators, reading results, checking formulas, and using save, print, share, and export actions correctly.

P & C

Permutation & Combination

Calculate nPr and nCr using factorials.

Scientific

Scientific Calculator

Perform complex mathematical operations.

Results

10! (Factorial)

3,628,800

Stirling's Approximation3.5987e+6

Number of Digits7

Γ(n+1) Confirmation3628800.000

Factorial Growth Chart

Factorial growth (log₁₀ scale) for n = 1 to 10

Step-by-Step Derivation

Calculate \(10!\) using the recurrence \(n! = n \times (n-1)!\):

\[10! = 2 \times 3 \times 4 \times 5 \times 6 \times 7 \times 8 \times 9 \times 10 = 3,628,800\]

Stirling's Approximation: \[10! \approx \sqrt{2\pi \times 10} \times \left(\frac{10}{e}\right)^{10} \approx 3.5987e+6\]

Relative error: \[\frac{|3.629e+6 - 3.599e+6|}{3.629e+6} \approx 0.830\%\]

Gamma function relation: \[\Gamma(11) = 10! = 3,628,800\]

How to understand and use this calculator

The Fundamentals of the Factorial Operation

The factorial function, denoted by an exclamation mark (n!), is one of the most foundational operations in discrete mathematics, probability theory, and combinatorial analysis. The factorial of a non-negative integer n is defined as the product of all positive integers less than or equal to n: n! = n × (n-1) × (n-2) × … × 1. By convention, 0! = 1, which keeps formulas for binomial coefficients and series expansions consistent. The primary use of the factorial is counting permutations — the number of ways to arrange n distinct objects in a sequence.

Factorials grow extremely fast. While 5! = 120 and 10! = 3{,}628{,}800, by 171! the result exceeds the maximum value a standard 64-bit floating-point number can hold (about 10^(308)), causing overflow. This calculator's Integer Factorial mode supports exact results for n from 0 to 170; beyond that it reports the overflow and falls back to Stirling's approximation.

How to Use This Calculator

Switch between Integer Factorial mode (enter any whole number from 0 to 170) and Gamma Function mode (enter any positive real number z, including non-integers). The calculator returns the exact result and, for integer factorials, Stirling's approximation alongside the relative error between the two.

Worked Example: 10! and Its Stirling Approximation

10! = 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 3{,}628{,}800

10! ≈ √(2π(10))(10/e)^(10) ≈ 3{,}598{,}695.6

The Stirling estimate is off by about 0.83% at n=10 — already a close approximation, and the relative error keeps shrinking as n grows larger, which is exactly why the formula is used for factorials too large to compute exactly.

Related Calculators

Factorials are the building blocks of counting problems solved directly by the binomial distribution calculator, which uses C(n,k) under the hood. For general exponentials and logarithms outside combinatorics, use the scientific calculator.

Continuous Extension: The Euler Gamma Function

The classic factorial is only defined for non-negative integers. Leonhard Euler's Gamma Function, denoted Γ, extends it to real (and complex) numbers. For any number z with a positive real part, it is defined by the improper integral Γ(z) = ∫_0^∞ t^(z-1) e^(-t) dt, and it satisfies Γ(n) = (n-1)! for any positive integer n — making it the continuous analog of the discrete factorial.

One striking result is the Gamma function's value at a half-integer: Γ(1/2) = √(π). The Gamma function underlies several continuous probability distributions, including the Student's t-distribution, the Chi-squared distribution, and the Beta distribution — this calculator's Gamma Function mode evaluates it directly for any z > 0.

Stirling's Approximation for Extreme Computations

When a factorial is too large to compute exactly, Stirling's approximation gives a fast, accurate estimate: n! ≈ √(2π n) (n/e)^n. As n grows, the ratio between the true factorial and Stirling's estimate converges to 1 — the relative error at n=10 is under 1%, and it keeps shrinking.

In physics and information theory, the logarithmic form ln(n!) ≈ n ln(n) - n is common — it underlies the Boltzmann entropy formula in statistical thermodynamics and the O(n log n) lower bound for comparison-based sorting algorithms.

Beyond This Calculator: Log-Gamma and Numerical Stability

This calculator reports exact factorials and the raw Gamma function value, not the log-gamma. For very large arguments, dedicated scientific computing libraries typically work with ln(Γ(z)) (log-gamma) instead of Γ(z) directly, since the raw Gamma value overflows a 64-bit float far sooner than its logarithm does — for example Γ(100) exceeds 10^(155), but ln(Γ(100)) ≈ 359.13 is a perfectly ordinary number.

That log-domain trick — computing exp(lnΓ(a) - lnΓ(b)) instead of Γ(a)/Γ(b) directly — is what lets Bayesian statistics and machine learning libraries (e.g. Dirichlet distributions, LDA topic models) work with Gamma ratios without overflowing. If your workflow needs log-gamma output specifically, a general-purpose scientific computing library (SciPy, R, etc.) is the right tool for that.

Applications in Probability and Combinatorics

Factorials drive the calculation of permutations and combinations. The binomial coefficient, C(n,k) = n!/(k!(n-k)!), counts the number of ways to choose k items from n without regard to order — the basis of the binomial distribution used in quality control, A/B testing, and clinical trial modeling.

In the continuous domain, the Gamma function is the normalizing constant behind several distributions. The Gamma distribution models wait times and system reliability, while the Beta distribution — defined via ratios of Gamma functions — is central to Bayesian inference over unknown probabilities.

Related concepts

Beta Function

A function closely related to the Gamma function, used in calculus and probability theory to define the Beta distribution.

Combinatorics

The branch of mathematics dedicated to counting, arrangement, and combination of discrete elements within sets.

Poisson Distribution

A discrete probability distribution expressing the probability of a given number of events occurring within a fixed interval.

Frequently Asked Questions

What is the factorial of zero (0!), and why does it equal 1?+

By mathematical convention, 0! is defined as exactly 1. This keeps formulas for permutations, combinations, and series expansions valid when the sequence is empty.

What is the purpose of the Euler Gamma Function?+

The Gamma function is the continuous extension of the factorial. It allows 'factorial-like' values to be computed for real (and complex) numbers, bridging discrete combinatorics and continuous calculus.

How does the Gamma function relate to the factorial?+

For any positive integer n, Γ(n) = (n−1)!. The Gamma function is shifted by one integer relative to the standard factorial sequence.

What is Stirling's approximation and when is it used?+

Stirling's approximation, n! ≈ √(2πn)(n/e)ⁿ, estimates large factorials without computing them exactly. It's used whenever the exact factorial would overflow standard floating-point numbers.

Why does this calculator cap integer factorials at 170?+

171! exceeds roughly 10³⁰⁸, the largest value a standard 64-bit float can represent, so it overflows to Infinity. Values above 170 fall back to Stirling's approximation instead of an exact result.

Does this calculator show the Log-Gamma (LnGamma) value?+

No — it returns the exact factorial or the raw Gamma value, not its natural log. Log-gamma is useful for avoiding overflow with very large arguments in specialized statistical libraries, but it isn't a separate output here.

Can you calculate the factorial of a negative integer?+

No. The classic factorial is only defined for non-negative integers, and the Gamma function itself is undefined (has poles) at zero and all negative integers.

What is the value of the Gamma function at 1/2?+

Γ(1/2) = √π ≈ 1.772454, a well-known special value connecting the Gamma function to the geometry of circles.

How are factorials used in the binomial coefficient?+

The binomial coefficient formula, n!/(k!(n−k)!), counts the number of ways to choose k items from n without regard to order — the foundation of discrete probability calculations.

Does this calculator accept negative or complex z in Gamma mode?+

No — Gamma Function mode accepts real numbers z > 0 only. Negative and complex arguments aren't currently supported.

How to understand and use this calculator

The Fundamentals of the Factorial Operation

How to Use This Calculator

Worked Example: 10! and Its Stirling Approximation

10! = 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 3{,}628{,}800

10! ≈ √(2π(10))(10/e)^(10) ≈ 3{,}598{,}695.6

Related Calculators

Continuous Extension: The Euler Gamma Function

Stirling's Approximation for Extreme Computations

Beyond This Calculator: Log-Gamma and Numerical Stability

Applications in Probability and Combinatorics

Related concepts

Beta Function

A function closely related to the Gamma function, used in calculus and probability theory to define the Beta distribution.

Combinatorics

The branch of mathematics dedicated to counting, arrangement, and combination of discrete elements within sets.

Poisson Distribution

A discrete probability distribution expressing the probability of a given number of events occurring within a fixed interval.

Frequently Asked Questions

What is the factorial of zero (0!), and why does it equal 1?+

By mathematical convention, 0! is defined as exactly 1. This keeps formulas for permutations, combinations, and series expansions valid when the sequence is empty.

What is the purpose of the Euler Gamma Function?+

How does the Gamma function relate to the factorial?+

For any positive integer n, Γ(n) = (n−1)!. The Gamma function is shifted by one integer relative to the standard factorial sequence.

What is Stirling's approximation and when is it used?+

Stirling's approximation, n! ≈ √(2πn)(n/e)ⁿ, estimates large factorials without computing them exactly. It's used whenever the exact factorial would overflow standard floating-point numbers.

Why does this calculator cap integer factorials at 170?+

Does this calculator show the Log-Gamma (LnGamma) value?+

Can you calculate the factorial of a negative integer?+

No. The classic factorial is only defined for non-negative integers, and the Gamma function itself is undefined (has poles) at zero and all negative integers.

What is the value of the Gamma function at 1/2?+

Γ(1/2) = √π ≈ 1.772454, a well-known special value connecting the Gamma function to the geometry of circles.

How are factorials used in the binomial coefficient?+

The binomial coefficient formula, n!/(k!(n−k)!), counts the number of ways to choose k items from n without regard to order — the foundation of discrete probability calculations.

Does this calculator accept negative or complex z in Gamma mode?+

No — Gamma Function mode accepts real numbers z > 0 only. Negative and complex arguments aren't currently supported.

Gamma Function & Large Factorial Calculator

Inputs

Results

Factorial Growth Chart

Step-by-Step Derivation

Factorial and Gamma Function Formulas

How the calculation works

Learn more about this calculation

Scientific Notation Guide: Powers of Ten Made Practical

How to Use Do The Calculation Calculators: A Practical Step-by-Step Guide

Permutation & Combination

Scientific Calculator

Gamma Function & Large Factorial Calculator

Inputs

Results

Factorial Growth Chart

Step-by-Step Derivation

Key output metrics

Exact vs. Stirling Approximation

How to understand and use this calculator

The Fundamentals of the Factorial Operation

How to Use This Calculator

Worked Example: 10! and Its Stirling Approximation

Related Calculators

Continuous Extension: The Euler Gamma Function

Stirling's Approximation for Extreme Computations

Beyond This Calculator: Log-Gamma and Numerical Stability

Applications in Probability and Combinatorics

Related concepts

Frequently Asked Questions

Factorial and Gamma Function Formulas

How the calculation works

Learn more about this calculation

Scientific Notation Guide: Powers of Ten Made Practical

How to Use Do The Calculation Calculators: A Practical Step-by-Step Guide

Permutation & Combination

Scientific Calculator

Key output metrics

Exact vs. Stirling Approximation

How to understand and use this calculator

The Fundamentals of the Factorial Operation

How to Use This Calculator

Worked Example: 10! and Its Stirling Approximation

Related Calculators

Continuous Extension: The Euler Gamma Function

Stirling's Approximation for Extreme Computations

Beyond This Calculator: Log-Gamma and Numerical Stability

Applications in Probability and Combinatorics

Related concepts

Frequently Asked Questions