Properties of the Number -21132

Twenty-One Thousand One Hundred Thirty-Two

Basics

Value: -21133 → -21132 → -21131

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 587

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 587

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001010001100

Octal: -51214

Duodecimal: -10290

Hexadecimal: -528c

Square: 446561424

Square Root: 145.3684972750286

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

Expansion of e.g.f. log( 1 + log(1 + x)² / 2 ). A346944

Numbers n such that n·5ⁿ - 1 is prime. A59676

T(n,k)=Number of nXk 0..3 arrays with no element equal to the sum modulo 4 of elements to its left or elements above it. A238775

Triangle read by rows: T(n,k) = number of chiral pairs of color patterns (set partitions) in a row of length n using exactly k colors (subsets). A320525

Expansion of 1/(1+6·x*c(x)), where c(x) = g.f. for Catalan numbers A000108. A127017

a(n) = 4·n³ + 5·n² + 2·n + 1. A204674

Number of chiral pairs of color patterns (set partitions) in a row of length n using exactly 5 colors (subsets). A320528

a(n) = ∑_{d | n} μ(n/d) * Bell(d-1). A34743

Smallest numbers containing exactly n smaller numbers when written as English number names. A159453

Riordan array (f(x), x·f(x)) where f(x) is the g.f. of A064613. A171568