Properties of the Number 8989

Eight Thousand Nine Hundred Eighty-Nine

Basics

Value: 8988 → 8989 → 8990

Parity: odd

Prime: No

Previous Prime: 8971

Next Prime: 8999

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 89 × 101

Divisors: 1, 89, 101, 8989

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001100011101

Octal: 21435

Duodecimal: 5251

Hexadecimal: 231d

Square: 80802121

Square Root: 94.81033698917012

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

Central Delannoy numbers: a(n) = ∑_k=0..n C(n,k)*C(n+k,k). A1850

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals. A262809

a(n) = prime(n)*prime(n+2). A90076

Number A(n,k) of lattice paths starting at {n}^k and ending when k or any component equals 0, using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals. A263159

Consider all permutations p_i of the first n primes; a(n) is the minimum over p_i of the maximal product of two adjacent primes in the permutation. A332765

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component or all components by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals. A229142

Square array read by descending antidiagonals: T(n, k) where column k is the expansion of 1/sqrt(1 - 2*(k+1)*x + ((k-1)*x)²). A307883

a(n)² is a square whose digits occur with an equal minimum frequency of 2. A52049

Number of integer partitions of n such that the upper-left square of the Young diagram has strictly greater graph-distance from the lower-right boundary than any other square. A325187

a(n) = T([n/2],[(n+1)/2]), where T = Delannoy triangle (A008288). A26003