Properties of the Number -13532

Thirteen Thousand Five Hundred Thirty-Two

Basics

Value: -13533 → -13532 → -13531

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 17 × 199

Divisors: 1, 2, 4, 17, 34, 68, 199, 398, 796, 3383

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11010011011100

Octal: -32334

Duodecimal: -79B8

Hexadecimal: -34dc

Square: 183115024

Square Root: 116.32712495372694

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

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x+3)^k for 0 <= k <= n. A248811

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation ∑_k=0..n (k+1)*x^k = ∑_k=0..n A_k*(x+3)^k. A246798

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9. A251652

a(n) = a(n-1)*a(n-2) - a(n-3), with a(1) = 0, a(2) = 1, a(3) = 2. A22405

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal. A232406

Number of partitions p of n such that median(p) > multiplicity(min(p)). A240215

a(n) is the minimum total surface area of four-element sets of distinct integer-sided cuboids that fill an n X n X n cube. A392884

a(n) = (n·3ⁿ⁺¹+((5·3ⁿ⁺¹+(-1)ⁿ)/4))/4. A191008

Number of 5-cycles in the n X n black bishop graph. A289163

Number of rooted trees with n nodes, 2 of which are labeled. A524