Factorial of 230

Counting with 230!

There are 7.7585 × 10^444 different ways to arrange 230 different books on a shelf: 230 choices for the first place, 229 for the second, and so on down to one choice for the last. If you only fill the first three places, as with gold, silver and bronze among 230 runners, there are 230 × 229 × 228 = 12,008,760 possible podiums. If the order does not matter, divide by 3! = 6 to get 2,001,460 ways to choose a group of three. Choosing a pair from 230 people can be done in 26,335 ways.

In probability, if 230 names are drawn out of a hat one at a time, the chance of drawing them in one particular order is 1 in 7.7585 × 10^444. That is why shuffled decks and passwords with many symbols are so hard to guess.

How big is 230!?

230! has 445 digits, so it is larger than the estimated number of atoms in the observable universe (about 10^80). The digits add up to 1746, a multiple of 9, as they are for every factorial from 6! on. Stirling's formula, √(2πn) × (n/e)^n, gives a close estimate without multiplying everything out, and gets more accurate as n grows.

Prime factors of 230!

Every prime up to 230 divides 230!. Legendre's formula counts how often: add ⌊n/p⌋ + ⌊n/p²⌋ + ⌊n/p³⌋ + … for each prime p. For 230! that gives 2^225 × 3^111 × 5^56 × 7^36 × 11^21 × 13^18 × 17^13 × 19^12 × 23^10 × 29^7 × … (50 primes in all). The 56 trailing zeros come from pairing the 56 factors of 5 with factors of 2.

Shuffles where nothing stays put

A related count is the number of derangements of 230 items: orders in which no item ends up in its original place, as in a Secret Santa where nobody draws their own name. The count is the whole number nearest to 230! ÷ e, so about 36.8% of all 7.7585 × 10^444 orders are derangements. From about four items on, that share stays close to 1 ÷ e, roughly 37%, however many items there are.

Computing 230! yourself

In Excel or Google Sheets, type =FACT(230). Spreadsheets keep only 15 significant digits, so from 18! on the result is rounded, and FACT stops at 170!, the largest factorial that fits in a standard floating-point number. In Python, math.factorial(230) returns the exact integer with all 445 digits, because Python integers have no size limit. The gamma function extends factorials to fractions: Γ(n + 1) = n!, so (1/2)! = √π ÷ 2 ≈ 0.8862.

Why is 0! equal to 1?

There is exactly one way to arrange nothing, and the rule n! = n × (n − 1)! only works for n = 1 if 0! = 1. Defining it this way keeps formulas for combinations and series correct at the edges.