Properties of the Number -1580

Five Hundred Eighty

Basics

Value: -1581 → -1580 → -1579

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 79

Divisors: 1, 2, 4, 5, 10, 20, 79, 158, 316, 395

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11000101100

Octal: -3054

Duodecimal: -AB8

Hexadecimal: -62c

Square: 2496400

Square Root: 39.74921382870358

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

Matrix inverse of triangle A104505, which is the right-hand side of triangle A084610 of coefficients in (1 + x - x²)ⁿ. A104509

Triangle read by rows, numerators of coefficients (in rising powers) of rational polynomials P(n, x) such that Integral_x=0..1 P'(n, x) = BernoulliMedian(n). A291447

G.f.: 2·q * ∏_n>=1 (1 + q^2·n)/((1 + qⁿ)*(1 + q^2·n-1)*(1 + q^4·n)) in powers of q. A293132

Array of coefficients of powers of x² for (S(2·n+1,x)/x)³, with Chebyshev's S polynomials A049310. A220665

Expansion of x*(1-x)/(1-x+2·x³-x⁴). A104554

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

Binomial centered tridigonal matrices as a triangular sequence: t(n,m.d)=If[n + m - 1 == d, binomial[d - 1, n - 1], If[n + m == d, -1, If[n + m - 2 == d, -1, 0]]]. A124030

a(n) = n*(4·n-1). A33991

Triangle, read by rows of n²+1 terms, of coefficients of q in the q-analog of the even double factorials: T(n,k) = [q^k] ∏_j=1..n (1-q^2j)/(1-q) for n>0, with T(0,0)=1. A128084

a(n) = a(n-1) + a(n-2) + a(n-3); a(0) = -1, a(1) = 2, a(2) = 2. A100683