Properties of the Number -539

Five Hundred Thirty-Nine

Basics

Value: -540 → -539 → -538

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 ² × 11

Divisors: 1, 7, 11, 49, 77, 539

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -1000011011

Octal: -1033

Duodecimal: -38B

Hexadecimal: -21b

Square: 290521

Square Root: 23.2163735324878

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

Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the n-th term of the k-th differences of partition numbers A000041. A175804

a(n) = [qⁿ] (1 - q)ⁿ / ∏_j=1..n (1 - q^j). A281425

Expansion of 1/(1-x*(1-6·x)). A145934

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0 < r <= n. Sequence contains the leading diagonal. A110427

Table of coefficients of the algebraic number s(2·l+1) = 2·sin(π/(2·l+1)) as a polynomial in odd powers of ρ(2*(2·l+1)) = 2·cos(π/(2*(2·l+1))) (reduced version). A228785

Coefficients of replicable function number 12c. A58491

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0<r<=n. e.g. the row corresponding to 4 contains 4, (3+2),{(1) +(0)+(-1)}, {(-2)+(-3)+(-4)+(-5)} ----> 4,5,0,-14 1 2 1 3 3 -3 4 5 0 -14 5 7 3 -10 -35 6 9 6 -6 -30 -69 ... Sequence contains the array by rows. A110425

McKay-Thompson series of class 12c for the Monster group with a(0) = -4. A186930

McKay-Thompson series of class 12c for the Monster group with a(0) = 4. A187045

Triangle read by rows: T(n,k) = ∑_i=0..n-1 binomial(n-1, i)*T(n-1-i,k-1) - ∑_i=1..n-1 binomial(n-1,i)*T(n-1-i,k) for 1 <= k <= n+1 with T(0,1) = 1 (and T(n,k) = 0 otherwise). A341287