Properties of the Number 21898

Twenty-One Thousand Eight Hundred Ninety-Eight

Basics

Value: 21897 → 21898 → 21899

Parity: even

Prime: No

Previous Prime: 21893

Next Prime: 21911

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 10949

Divisors: 1, 2, 10949, 21898

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101010110001010

Octal: 52612

Duodecimal: 1080A

Hexadecimal: 558a

Square: 479522404

Square Root: 147.97972834141845

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

Number of partitions of n having no perfect cube parts (n>=0). A264393

Triangle read by rows: T(n,k) is the number of strongly connected directed multigraphs with loops, with n arcs and k vertices. A139622

Consecutive states of the linear congruential pseudo-random number generator (625·s + 6571) mod 31104 when started at s=1. A385279

Numbers k such that the continued fraction for sqrt(k) has period 91. A20430

σ(n)-n values in A085844. A216383

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 798", based on the 5-celled von Neumann neighborhood. A273571

Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 17. A31605

A linear combination of Eulerian numbers (A008292) and Pascal's triangle (A007318); t(n,m)=(3·A008292(n,m)-A007318(n,m))/2. A141691

Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order. A204746

T(n, k) = ∑_j=k..n binomial(n, j)*E2(j, j-k), where E2 are the Eulerian numbers A201637. Triangle read by rows, T(n, k) for 0 <= k <= n. A343804