Properties of the Number -15664

Fifteen Thousand Six Hundred Sixty-Four

Basics

Value: -15665 → -15664 → -15663

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 11 × 89

Divisors: 1, 2, 4, 8, 11, 16, 22, 44, 88, 89

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11110100110000

Octal: -36460

Duodecimal: -9094

Hexadecimal: -3d30

Square: 245360896

Square Root: 125.15590277729612

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

Number of partitions of n having an integer median. A325347

a(1)=1, a(n)=a(n-1)+n if n odd, a(n)=a(n-1)+ n² if n is even. A140113

Recurrence a(n) = a(n-2) + n^M for M=4, starting with a(0)=0, a(1)=1. A231303

Representation degeneracies for boson strings. A5291

Array read by ascending antidiagonals: A(n, k) = (-1)^{n + k} * ∑_j=0..k (j!)² * Stirling1(n, j) * Stirling1(k, j). A379821

Length of the long leg in the unique primitive Pythagorean triple (x,y,z) such that (x-y+z)/2 = A000045(n) and its long leg and hypotenuse are consecutive natural numbers. A382843

a(n) = Fibonacci(2·n)-2ⁿ+1. A47790

Number of primitive roots modulo prime(n)², where prime(n) is n-th prime. A104039

Convolution of A006068 (inverse of Gray code) with itself: a(n) = ∑_k=1..n+1 A006068(k) * A006068(1+n-k). A268721

a(n) is the determinant of the 2 X 2 matrix whose entries (when read by rows) are the n-th primes congruent to 1, 3, 5, 7 mod 8 respectively. A337145