Properties of the Number 84480

Eighty-Four Thousand Four Hundred Eighty

Basics

Value: 84479 → 84480 → 84481

Parity: even

Prime: No

Previous Prime: 84467

Next Prime: 84481

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁹ × 3 × 5 × 11

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 11, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100101000000000

Octal: 245000

Duodecimal: 40A80

Hexadecimal: 14a00

Square: 7136870400

Square Root: 290.6544339933592

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

Ramanujan's τ function (or Ramanujan numbers, or τ numbers). A594

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k ddu's [here u = (1,1) and d = (1,-1)]. A91894

Triangle read by rows, coefficients of the polynomials P(k, x) = (1/2) ∑_p=0..k-1 Stirling2(k, p+1)*x^p*(1-4·x)^k-1-p*(2·p+2)!/(p+1)!. A142963

Coefficients of Chebyshev T polynomials: a(n) = A053120(n+8, n), n >= 0. A6974

Number of 4-ary Lyndon words of length n over Z₄ with trace 2 and subtrace 2. A74412

Coefficient table for Chebyshev polynomials T(2·n,x) (increasing even powers x, without zeros). A127674

Number of different multisets that can be obtained by choosing a prime index (or a prime factor) of each integer from 2 to n. A355746

a(n) = σ(σ(...(σ(n))...)) / n, where σ (A000203) is iterated until a multiple of n is reached. A19295

T(n, k) = ∑_j=0..k (-1)^j*binomial(2·k, j)*(k - j)^2·n/k!, triangle read by rows, n >= 0 and 0 <= k <= n. A304334

8-idempotent numbers: a(n) = binomial(n+8,8)*8ⁿ. A141054