Properties of the Number 89664

Eighty-Nine Thousand Six Hundred Sixty-Four

Basics

Value: 89663 → 89664 → 89665

Parity: even

Prime: No

Previous Prime: 89659

Next Prime: 89669

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ⁶ × 3 × 467

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111001000000

Octal: 257100

Duodecimal: 43A80

Hexadecimal: 15e40

Square: 8039632896

Square Root: 299.43947635540644

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

Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0. A67331

Number of cyclic subgroups of the group (C_n)⁵, where C_n is the cyclic group of order n. A344219

a(n) = a(n-1) + a(n-2) + F(n), with a(0) = 0, a(1) = 1, a(2) = a(1) + a(0), a(3) = a(2) + a(1), a(4) = a(3) + a(2) + 2. A166106

The fifth row of the ED1 array A167546. A167548

a(n) = 2·a(n-1) + a(n-2) - 2·a(n-3) - a(n-4) for n>3, a(0)=a(1)=a(3)=0, a(2)=1. A240847

Expansion of g.f.: 1/( (1+2·x)*(1-2·x-4·x²)*(1-2·x²)² ). A121961

Sum of the third largest parts of the partitions of 4n into 4 parts. A242727

The ED1 array read by antidiagonals. A167546

a(n) = S2(n,1), where S2(n, t) = ∑_k=0..n k^t *(∑_j=0..k binomial(n,j))². A89664

Number of non-equivalent (mod D₃) ways to place 4 indistinguishable points on a triangular grid of side n so that no two of them are adjacent. A239574