145 Factorial — What is 145! ?
145! — Results
Exact value
=
8.0479260 × 10251 — Show full value
804792605747199194484902925779806277109997439007500616344745281047115412373646521410850481879839649227439298230298915019813108221651663659572441609408556917739149315905992811411866635786075524601835815642793302504243200000000000000000000000000000000000
Number of digits
=
252
Scientific notation
=
8.0479260 × 10251
Stirling's approximation
≈
8.043302 × 10251
n! ≈ √(2πn) · (n/e)ⁿ
Factorial neighbourhood of 145
The table below shows how quickly factorials grow around 145.
Calculate another factorial
Integers from 0 to 170 (171! overflows IEEE 754 double).
About 145!
145! equals 145 × 144! = 145 × 5.5502938 × 10249. In combinatorics, 145! is the number of ways to arrange 145 distinct objects in a sequence — that is, the number of permutations of a set of 145 elements.
Connections to other branches of mathematics
Like all factorials, 145! appears in the binomial coefficient C(145, k) = 145! / (k! · (145−k)!) for any 0 ≤ k ≤ 145. This counts the number of k-element subsets of a 145-element set. The row 145 of Pascal's triangle sums to 2145 = 1,073,741,824….
About factorials
What is a factorial?
The factorial of a non-negative integer n, written n!, is the product of all positive integers from 1 to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. By convention, 0! = 1 (the empty product).
How fast do factorials grow?
Factorials grow faster than any exponential function. While 2ⁿ doubles at each step, n! multiplies by n — an ever-increasing factor. By n = 100, we already have 100! ≈ 9.33 × 10157, and 170! reaches about 7.26 × 10306.
What is Stirling's approximation?
Stirling's formula provides a practical way to estimate large factorials: n! ≈ √(2πn) · (n/e)ⁿ. The relative error is already below 1% for n = 10 and below 0.1% for n = 100. It is widely used in combinatorics, statistical mechanics, and information theory.
Factorials in combinatorics
Factorials count permutations: n! is the number of ways to arrange n distinct objects in a row. They also appear in combinations C(n,k) = n! / (k!(n−k)!), in Taylor series (the n-th term is divided by n!), and in the Gamma function: Γ(n+1) = n!.
Why does 171! overflow?
IEEE 754 double-precision floats can represent values up to ≈ 1.8 × 10308. Since 170! ≈ 7.26 × 10306 is within range but 171! ≈ 1.24 × 10309 is not, 171! evaluates to
Infinity in most languages using native floats.Frequently asked questions
0! = 1 by convention. This follows from the definition of the empty product: the product of no numbers is the multiplicative identity, 1. It also ensures that C(n,0) = n!/(0!·n!) = 1 remains consistent for all n.
100! has exactly 158 digits. This is computed as ⌊log₁₀(100!)⌋ + 1 = ⌊∑ log₁₀(k) for k=1 to 100⌋ + 1 = 157 + 1 = 158.
Exactly 52! ≈ 8.07 × 1067 ways. This number is so astronomically large that every shuffle performed in all of human history is almost certainly unique.
This tool computes exact integer values up to 170! — the largest factorial that fits in an IEEE 754 double. 170! has 307 digits.
The digit count is ⌊log₁₀(n!)⌋ + 1. By logarithm properties, log₁₀(n!) = ∑ log₁₀(k) for k=1 to n. This is computable in O(n) without big-integer arithmetic.
The Gamma function Γ(z) generalises factorials to complex numbers: Γ(n+1) = n! for any non-negative integer n. Γ(1/2) = √π, and Γ(3/2) = √π/2.