Properties of the Number -18664

Eighteen Thousand Six Hundred Sixty-Four

Basics

Value: -18665 → -18664 → -18663

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 2333

Divisors: 1, 2, 4, 8, 2333, 4666, 9332, 18664

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100100011101000

Octal: -44350

Duodecimal: -A974

Hexadecimal: -48e8

Square: 348344896

Square Root: 136.61625086350452

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

Sum of GCD's of parts in all partitions of n. A78392

Sum of positive ranks of all overpartitions of n. A236001

Number of polydrafters: a(n) is the number of polydrafters with n cells. A56842

a(n) = 6·a(n-1) - 8. A5618

a(n) is a refactorable number and the sum of all refactorable numbers <= a(n) is also a refactorable number. A235177

For positive n with prime decomposition n = ∏_j=1..m (p_j^k_j) define A_n = ∑_j=1..m (p_j*k_j) and B_n = ∑_j=1..m (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair). A185718

a(n) = (n² + 2*(∑_{j = 1..n} jⁿ)) (mod n³). A219540

Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250609

Number of (n+1) X (7+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250610

Number of n-digit base-4 deletable primes. A96237