Properties of the Number -21051

Twenty-One Thousand Fifty-One

Basics

Value: -21052 → -21051 → -21050

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 2339

Divisors: 1, 3, 9, 2339, 7017, 21051

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001000111011

Octal: -51073

Duodecimal: -10223

Hexadecimal: -523b

Square: 443144601

Square Root: 145.08962747212496

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

Sum of squares of three consecutive primes. A133529

Number of 1-sided snake polyominoes with n cells. A151514

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) >= number of distinct parts of p. A241821

a(n) = ∑_{k=0..floor(n/4)} binomial(2·n-5·k,3·k). A392404

Number of 2-sided strip polyrhombs with n cells. A151524

Number of Motzkin paths of length n up to reversal. A378941

If p(k) is the k-th prime, then the n-th set of 3 consecutive cousin prime pairs starts at p(a(n)). A95970

a(n) = ∑_{k=0..floor(n/8)} binomial(n-5·k, 3·k). A113032

Number of (n+1) X 3 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A204645

Number of nonequivalent binary matrices with 4 columns and any number of nonzero rows with n ones in every column up to permutation of rows and columns. A331720