Properties of the Number -21170

Twenty-One Thousand One Hundred Seventy

Basics

Value: -21171 → -21170 → -21169

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 29 × 73

Divisors: 1, 2, 5, 10, 29, 58, 73, 145, 146, 290

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001010110010

Octal: -51262

Duodecimal: -10302

Hexadecimal: -52b2

Square: 448168900

Square Root: 145.49914089093448

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 1/(1 - x - x⁸ - x¹⁵ + x¹⁶). A173925

a(n) = n*(n+1)*(5·n+1)/6. A33994

Number of points on surface of hexagonal prism: 12·n² + 2 for n > 0 (coordination sequence for W(2)). A5914

Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 2 (mod p-1), where s_p(m) is the sum of the base p digits of m. A324404

Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram". A34587

Even numbers seen in decimal expansion of π (disregarding the decimal period) contiguous, smallest and distinct. A50818

Pseudo-random numbers: Davenport's generator for 32-bit integers. A84277

Number of n-celled polyominoes without holes, symmetric about axis 2. A56880

Deficient oblong numbers. A77804

a(n) = (4·n+1)*(4·n+2) = (4·n+2)!/(4·n)!. A157870