Properties of the Number -15564

Fifteen Thousand Five Hundred Sixty-Four

Basics

Value: -15565 → -15564 → -15563

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 1297

Divisors: 1, 2, 3, 4, 6, 12, 1297, 2594, 3891, 5188

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11110011001100

Octal: -36314

Duodecimal: -9010

Hexadecimal: -3ccc

Square: 242238096

Square Root: 124.75576139000555

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) is the number of ways to partition an n X n X n cube into 4 noncongruent cuboids. A384311

T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards. A206109

Number of self-avoiding walks of n steps on a Manhattan square lattice. A117633

Number of graphs on n labeled nodes with maximal degree exactly 2. A136284

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements. A203378

Row sums of Riordan array ((1-3x)/(1-4x+x²), x(1-x)/(1-4x+x²)). A147722

Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and minimum vertex-degree k. A327366

Triangle read by rows: T(n,k) = ∑_{c in C(n,k)} lcm(c) where C(n,k) is the set of all k-subsets of {1,2,...,n}. A181853

Number of n-node trees of height at most 4. A1384

Row sums of A094307. A94308