Properties of the Number 10489

Ten Thousand Four Hundred Eighty-Nine

Basics

Value: 10488 → 10489 → 10490

Parity: odd

Prime: No

Previous Prime: 10487

Next Prime: 10499

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 17 × 617

Divisors: 1, 17, 617, 10489

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100011111001

Octal: 24371

Duodecimal: 60A1

Hexadecimal: 28f9

Square: 110019121

Square Root: 102.41581909060729

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

Indices of prime Mersenne numbers (A001348). A16027

Total number of perfect powers > 1 below 10ⁿ. A89579

T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row and column greater than the previous repeated value. A267719

Expansion of ∏_k>=1 ((1 - x^7*(2·k-1)) * (1 - x^7·k) / (1 - x^k)). A280937

Terms of A121707 not in A267999. A306097

Number of nonnegative integer matrices with sum of entries equal to n and no zero rows or columns, whose entries are all distinct. A321660

Triangle of numerators for rational convergents to Taylor series of 1/γ(x+1). A386675

Table T(n,k) = sum over all set partitions of n of number at index k. A120057

Triangle T(n,k), n>=0, 0<=k<=n, read by rows: row n gives the coefficients of the chromatic polynomial of the (n,2)-Turán graph, highest powers first. A266972

Number of partitions of n into at most 12 parts. A8641