Properties of the Number 5040

Five Thousand Forty

Basics

Value: 5039 → 5040 → 5041

Parity: even

Prime: No

Previous Prime: 5039

Next Prime: 5051

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

8509 Try Today's Challenge

Representations

Binary: 1001110110000

Octal: 11660

Duodecimal: 2B00

Hexadecimal: 13b0

Square: 25401600

Square Root: 70.9929573971954

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

Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record. A2182

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

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 T(n,k) read by rows: multinomial coefficients for the partitions of n listed in Abramowitz-Stegun order, 1 <= k <= A000041(n). A36038