Properties of the Number -11614

Eleven Thousand Six Hundred Fourteen

Basics

Value: -11615 → -11614 → -11613

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5807

Divisors: 1, 2, 5807, 11614

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110101011110

Octal: -26536

Duodecimal: -687A

Hexadecimal: -2d5e

Square: 134884996

Square Root: 107.76826991280875

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) = (-4·n³ + 27·n² - 20·n + 3)/3. A161711

Number of partitions of n in which the number of parts divides n. A67538

Number of integer partitions of n with integer mean and integer median. A359906

Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways. A13583

Square array A(n, k) = 2·A246278(n, k) - σ(A246278(n, k)), read by falling antidiagonals. Deficiency applied to the prime shift array. A378979

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero. A297951

a(n) = n³ - n² - n - 1. A83074

Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square. A163433

Number of partitions p of n such that if h = min(p), then h is an (h,1)-separator of p; see Comments. A239497

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero. A298560