Properties of the Number -3086

Eighty-Six

Basics

Value: -3087 → -3086 → -3085

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 1543

Divisors: 1, 2, 1543, 3086

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110000001110

Octal: -6016

Duodecimal: -1952

Hexadecimal: -c0e

Square: 9523396

Square Root: 55.5517776493246

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

Triangle T(n, k, q) = (1-qⁿ)*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - (1-qⁿ) + 1, for q = 2, read by rows. A174731

Numbers that are the sum of 11 positive 7th powers. A3378

Interprimes (A024675) which are of the form s·prime, s=2. A75277

T(n,k)=Number of 0..2 arrays of length n+2·k-1 with sum less than 2·k in any length 2k subsequence (=less than 50% duty cycle). A212729

a(n) = prime(n)² - prime(n²). Commutator of (primes, squares) at n. A123914

a(n) = ceiling(binomial(n,4)/n). A53618

Length of n-th iterate of the mapping 00->1000, 10->011, starting with 00. A288243

Möbius transform of A341512, σ(n)*A003961(n) - n*σ(A003961(n)). A346239

Number of n-node trees of height at most 5. A1385

Consider the Diophantine equation x³ + y³ = z³ - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x. A50788