Properties of the Number 89497

Eighty-Nine Thousand Four Hundred Ninety-Seven

Basics

Value: 89496 → 89497 → 89498

Parity: odd

Prime: No

Previous Prime: 89491

Next Prime: 89501

Digit Sum: 37

Digital Root: 1

Palindrome: No

Factorization: 31 × 2887

Divisors: 1, 31, 2887, 89497

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10101110110011001

Octal: 256631

Duodecimal: 43961

Hexadecimal: 15d99

Square: 8009713009

Square Root: 299.1604920439863

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

Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n). A47874

Number of permutations of length n with longest increasing subsequence of length 3. A1454

Number of n X 2 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,3,2,1,0 for x=0,1,2,3,4. A197211

Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^-8. A114360

Triangle of numbers read by rows: T(n,k) = number of permutations σ of (1,2,...,n) with n - {length of longest increasing subsequence in σ} = k (0<=k<=n-1). A126065

Row sums of A050157. A296771

a(n) = ∑_{k=0..floor((n+1)/2)} (k+1) * A008315(n, k). A27305

Sequence read from antidiagonals of rectangular array with entry in row n and column q given by T(n,q) = 2^2·n*(∑_j=1..n+1 (cos(j*π/(2·q+1)))^2·n), n >= 0, q >= 1. A186740

μ(prime(n)+1) - μ(prime(n)-1), where μ is the Moebius function. A89497