Properties of the Number 22889

Twenty-Two Thousand Eight Hundred Eighty-Nine

Basics

Value: 22888 → 22889 → 22890

Parity: odd

Prime: No

Previous Prime: 22877

Next Prime: 22901

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 47 × 487

Divisors: 1, 47, 487, 22889

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100101101001

Octal: 54551

Duodecimal: 112B5

Hexadecimal: 5969

Square: 523906321

Square Root: 151.29111011556495

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

Partitions with subdiagonal growth: number of partitions (p0, p1, p2, ...) of n with π - p0 <= i. A238876

Semiprimes in A103372. A103392

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 838", based on the 5-celled von Neumann neighborhood. A290546

a(n) is the number of different linear hydrocarbon molecules with n carbon atoms. A306334

a(n) is the number of 4 element sets of integer sided trapezoids with distinct areas and base angles that are 60 degrees, which fill an equilateral triangular grid of side n units. A389518

a(n) = s(1)*s(2)*...*s(n)*(1/s(1) - 1/s(2) + ... + c/s(n)), where s(1) = 1, s(k) = p(k-1) for k >= 2 and c = (-1)ⁿ⁺¹. A24529

a(n) = 4·a(n-1) - 6·a(n-2) + 4·a(n-3) - a(n-4) + a(n-5) with a(1) = 1, a(2) = 2, a(3) = 4, a(4) = 8, and a(5) = 15. A385107

Cycle class sequence c(n) (number of true cycles of length n in which a certain node is included) for zeolite NON = Nonasil-[ 4158 ] [Si88O176].4R starting with a T1 atom. A19209

Number of ways to partition an n X 6 grid into 3 connected equal-area regions. A167253

T(n,m) = Number of ways to partition an nXm grid into 3 connected equal-area regions. A167259