Properties of the Number 60480

Sixty Thousand Four Hundred Eighty

Basics

Value: 60479 → 60480 → 60481

Parity: even

Prime: No

Previous Prime: 60457

Next Prime: 60493

Digit Sum: 18

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

5184 Try Today's Challenge

Representations

Binary: 1110110001000000

Octal: 166100

Duodecimal: 2B000

Hexadecimal: ec40

Square: 3657830400

Square Root: 245.92681838303037

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

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

Expansion of Eisenstein series E₄(q) (alternate convention E₂(q)); θ series of E₈ lattice. A4009

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

a(n) = n!/6. A1715

Triangle of permutation coefficients arranged with 1's on the diagonal. Also, triangle of permutations on n letters with exactly k+1 cycles and with the first k+1 letters in separate cycles. A94587

The Hirzebruch numbers. a(n) = ∏_{2 <= p <= n+1, p prime} p^floor(n / (p - 1)). A91137

Triangle read by rows: T(n, k) = n! / k!, 1 <= k <= n. A173333

Triangle of falling factorials, read by rows: T(n, k) = n*(n-1)*...*(n-k+1), n > 0, 1 <= k <= n. A68424

Triangle read by rows: terms of a binomial decomposition of 1 as Sum(k=0..n)T(n,k). A244117

Triangle read by rows: terms T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k). A244133

Triangle read by rows: terms T(n,k) of a binomial decomposition of nⁿ as Sum(k=0..n)T(n,k). A244137