Properties of the Number -12284

Twelve Thousand Two Hundred Eighty-Four

Basics

Value: -12285 → -12284 → -12283

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 37 × 83

Divisors: 1, 2, 4, 37, 74, 83, 148, 166, 332, 3071

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10111111111100

Octal: -27774

Duodecimal: -7138

Hexadecimal: -2ffc

Square: 150896656

Square Root: 110.83320801997928

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

Exponential Riordan array (sech(x), tanh(x)). A60081

a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 1, a(2) = 0. A105578

a(n) = a(n-2) - (a(n-1) - a(n-2)) if (n mod 2) = 0, otherwise a(n) = a(n-1) - (a(n-3) - a(n-4)), with a(0) = 0, a(1) = 1, a(2) = -1, a(3) = 2. A135690

A symmetrical triangle sequence: T(n, k) = q^k + q^n-k - qⁿ, with q=4. A176227

a(n) = 4 - 3·2ⁿ. A165751

Number of non-self-conjugate partitions of n. A330644

a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks. A347789

Triangle of numbers related to A000330 (sum of squares) and A000364 (Euler numbers). A60058

T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than one standard deviation from its mean. A244788

T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having the maximum of any two terms equal to the minimum of the remaining five terms. A250059