Properties of the Number -20554

Twenty Thousand Five Hundred Fifty-Four

Basics

Value: -20555 → -20554 → -20553

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 43 × 239

Divisors: 1, 2, 43, 86, 239, 478, 10277, 20554

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101000001001010

Octal: -50112

Duodecimal: -BA8A

Hexadecimal: -504a

Square: 422466916

Square Root: 143.3666627915988

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

a(n) = 1 + 2·n + 3·n² + 4·n³. A56578

T(n,k)=Number of (n+1)X(n+1) 0..k arrays with each 2X2 subblock determinant nonzero and the array of 2X2 subblock determinants symmetric under 90 degree rotation. A187528

Number of partitions of n such that (greatest part) - (least part) >= number of parts. A237834

Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5), starting 1,0,0,0,1. A124313

G.f.: 1 / ∏_i>=1 (1-q^2·i-1)²*(1-q^12·i-8)*(1-q^12·i-6)*(1-q^12·i-4)*(1-q^12·i). A201077

The least k such that A063994(k) = ∏_{primes p dividing k} gcd(p-1, k-1) = n, or 0 if there's no such k. A64234

Number of compositions into a prime number of distinct parts. A102623

Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k UUDUDD's starting at level 0 (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)). A166295

Number of Dyck paths of semilength n with no UUU's and no DDD's and having no UUDUDD's starting at level 0 (U=(1,1), D=(1,-1)). A166296

a(1)=1, a(n)=n·17^n-1+a(n-1). A14934