Properties of the Number 84490

Eighty-Four Thousand Four Hundred Ninety

Basics

Value: 84489 → 84490 → 84491

Parity: even

Prime: No

Previous Prime: 84481

Next Prime: 84499

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 7 × 17 × 71

Divisors: 1, 2, 5, 7, 10, 14, 17, 34, 35, 70

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: 10100101000001010

Octal: 245012

Duodecimal: 40A8A

Hexadecimal: 14a0a

Square: 7138560100

Square Root: 290.6716360431475

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

Numbers that are the sum of nine fifth powers in three or more ways. A345620

Numbers that are the sum of nine fifth powers in exactly three ways. A346338

Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose smallest connected component has exactly k nodes; n >= 0, 0 <= k <= n. A347999

Triangle read by rows: T(n,k) is the number of endofunctions on [n] whose second-smallest component has size exactly k; n >= 0, 0 <= k <= max(0,n-1). A350079

a(n) = n*(2·n² + 5·n + 3). A163815

For bases b = 2, 3, ..., n, let the base-b expansion of n be [c_1,b c_2,b .. c_{r_b,b}], with the most significant "digit" on the left, 0 <= c_i,b < b, and c_1,b ≠ 0; then a(n) is the number whose base-n expansion is the sum of all those expansions, regarding the c_i,j as integers mod n. A247880

Expansion of ∑_k>=1 k⁴ * x^k/(1 - x^k)⁴. A366933

Inverse permutation to A084489. A84490