Properties of the Number 21152

Twenty-One Thousand One Hundred Fifty-Two

Basics

Value: 21151 → 21152 → 21153

Parity: even

Prime: No

Previous Prime: 21149

Next Prime: 21157

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ⁵ × 661

Divisors: 1, 2, 4, 8, 16, 32, 661, 1322, 2644, 5288

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 101001010100000

Octal: 51240

Duodecimal: 102A8

Hexadecimal: 52a0

Square: 447407104

Square Root: 145.43727170158274

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 length n+3 0..k arrays with no disjoint pairs in any consecutive four terms having the same sum. A247726

Expansion of ∏_k>=1 ((1+x^k)/(1-x^k))^{2^k}. A261519

Coefficient of x² in the reduction of the n-th Fibonacci polynomial by x³->x²+2x+1. A192774

Row sums of A291929. A291930

Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right. A297627

Number of integers m in [0..10ⁿ-1] such that m has no digit in common with the last n digits of m². A256713

Number of length n+3 0..4 arrays with no disjoint pairs in any consecutive four terms having the same sum. A247722

Number of length 4+3 0..n arrays with no disjoint pairs in any consecutive four terms having the same sum. A247730

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

E.g.f.: 2·cosh(x) / (1 + sqrt(1 - 2·sinh(2·x))). A318002