Properties of the Number 40320

Forty Thousand Three Hundred Twenty

Basics

Value: 40319 → 40320 → 40321

Parity: even

Prime: No

Previous Prime: 40289

Next Prime: 40343

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁷ × 3 ² × 5 × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110110000000

Octal: 116600

Duodecimal: 1B400

Hexadecimal: 9d80

Square: 1625702400

Square Root: 200.79840636817812

Classification

Fibonacci: No

Bell Number: No

Factorial Number: Yes

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Factorial numbers: n! = 1·2*3·4*...*n (order of symmetric group S_n, number of permutations of n letters). A142

Triangle read by rows: T(n,k) = ∑_j>=0 j!*T(n-j-1, k-1) for n >= 0, k >= 0. A84938

Triangle read by rows of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n. A8275

Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n. A48994

Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n). A19538

a(n) = (2n)!. A10050

Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n. A132393

Triangle T(n,k) = n!/(n-k)! (0 <= k <= n) read by rows, giving number of permutations of n things k at a time. A8279

Triangle of Lah numbers. A8297

Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n. A131689