Skip to main content
Calkulon

数学

阶乘计算器

阶乘计算器

n! = 1×2×3×...×n

变量说明

n= non-negative integern!= factorial of n

Definition

Product of all positive integers from 1 to n.

Base case

Recursive definition

Each factorial is n times the previous.

Stirling's approximation

Accurate estimate for large n.

详细指南即将推出

我们正在为阶乘计算器编写全面的教育指南。请尽快回来查看逐步解释、公式、真实案例和专家提示。

💡

专业提示

Stirling's approximation: n! ≈ √(2πn) × (n/e)ⁿ. For large n, this is very accurate. For n=10: exact = 3,628,800; Stirling gives 3,598,696 (0.83% error).

难度:中级

你知道吗?

The number of ways to shuffle a standard 52-card deck is 52! ≈ 8 × 10⁶⁷. This number is so large that every time you shuffle a deck, you are almost certainly creating an ordering that has never existed before in human history.

Mathematically verified
Reviewed May 2026
Used 52K+ times
Our methodology
🔒
100% 免费
无需注册
准确
经过验证的公式
即时
即时结果
📱
移动友好
所有设备

设置

隐私条款关于© 2026 Calkulon