Properties of the Number 89658

Eighty-Nine Thousand Six Hundred Fifty-Eight

Basics

Value: 89657 → 89658 → 89659

Parity: even

Prime: No

Previous Prime: 89657

Next Prime: 89659

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 17 × 293

Divisors: 1, 2, 3, 6, 9, 17, 18, 34, 51, 102

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10101111000111010

Octal: 257072

Duodecimal: 43A76

Hexadecimal: 15e3a

Square: 8038556964

Square Root: 299.4294574687

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302069

Number of nX7 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302068

Number of 3Xn 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302070

a(n) = S1(n,1), where S1(n, t) = ∑_k=0..n (k^t * ∑_j=0..k binomial(n,j)). A89658

Index of matching grid point in the bijection between two infinite triangular grids with one grid rotated by π/6 around the common point (0,0), using an enumeration of the grid points by A307014 and A307016. A367147

Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having two, three, four, six or seven distinct values for every i,j,k<=n. A211583