Googology Wiki


10,408pages on
this wiki
Add New Page
Talk12 Share

The hyperfactorial is defined as \(H(n) = \prod^{n}_{i = 1} i^i = 1^1 \cdot 2^2 \cdot 3^3 \cdot 4^4 \cdot \ldots \cdot n^n\).[1]

The first few values of \(H(n)\) for \(n = 1, 2, 3, 4, \ldots\) are 1, 4, 108, 27648, 86400000, 4031078400000, 3319766398771200000, 55696437941726556979200000, 21577941222941856209168026828800000, ... (OEIS A002109). The sum of the reciprocals of these numbers is 2.2592954398150629..., which can be approximated as \(\sqrt[12]{17688}\), or more precisely as \(\sqrt[7]{\sqrt[7]{3^{4}\cdot67\cdot3929\cdot10371376751}}\), a curious 18-decimal-place approximation where we have a double 7th root (7 is prime) of the product of seven prime factors.

Sources Edit

  1. Hyperfactorial from Wolfram MathWorld

See also Edit

Main article: Factorial
Multifactorials: Double factorial · Multifactorial
Falling and rising: Falling factorial · Rising factorial
Other mathematical variants: Alternating factorial · Hyperfactorial · q-factorial · Roman factorial · Subfactorial · Weak factorial
Tetrational growth: Exponential factorial · Expostfacto function · Superfactorial by Clifford Pickover
Array-based extensions: Hyperfactorial array notation · Nested factorial notation
Other googological variants: · Superfactorial by Sloane and Plouffe · Torian · Factorexation · Mixed factorial

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.