Properties of the Number 9489

Nine Thousand Four Hundred Eighty-Nine

Basics

Value: 9488 → 9489 → 9490

Parity: odd

Prime: No

Previous Prime: 9479

Next Prime: 9491

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 3163

Divisors: 1, 3, 3163, 9489

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10010100010001

Octal: 22421

Duodecimal: 55A9

Hexadecimal: 2511

Square: 90041121

Square Root: 97.41149829460586

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

Partial sums of A299256. A299262

Expansion of ∏_k>=1 (1 - x^8·k)/(1 - x^k). A261775

Indices k such that s_k(4) is a (probable) prime, where s_k(4) = 4·s_k-1(4) - s_k-2(4), k >= 2, s₀(4) = 1, s₁(4) = 5. A299100

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of tetrahedral numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 3·p-2, where a(i,p) satisfies ∑_i=1..n C(i+2,3)^p = 4·C(n+3,4) * ∑_i=1..3·p-2 a(i,p) * C(n-1,i-1)/(i+3). A87107

Nearest integer to πⁿ. A2160

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors. A238323

a(n) = ceiling(πⁿ). A1673

Number of partitions of n such that the number of parts having multiplicity 1 is not a part and the number of distinct parts is not a part. A241445

Numbers which need eleven 'Reverse and Add' steps to reach a palindrome. A65216

a(n) = ceiling(π^n/2). A102477