Properties of the Number -13562

Thirteen Thousand Five Hundred Sixty-Two

Basics

Value: -13563 → -13562 → -13561

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 6781

Divisors: 1, 2, 6781, 13562

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11010011111010

Octal: -32372

Duodecimal: -7A22

Hexadecimal: -34fa

Square: 183927844

Square Root: 116.45600027478189

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) = (4n-4k+1) * T(n-1,k-1) + (4k-3) * T(n-1,k). A142459

a(n) = (A048898(n)² + 1)/5ⁿ, n >= 0. A210848

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101. A260001

Positions of 2's in A264977; positions of 3's in A277330. A277712

The number of edges in a graph induced by a regular drawing of K_n,n. A290132

Sum of median parts of all partitions of n into an odd number of parts. A211373

a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n). A25017

a(n) = floor(exp(n)/n). A107316

Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees). A79219

G.f. A(x) satisfies 1/2 = ∑_n=-oo..+oo xⁿ*A(x)ⁿ * (A(x)ⁿ + x)^n-1 * (A(x) + xⁿ)^n-1. A380066