Properties of the Number -6986

Nine Hundred Eighty-Six

Basics

Value: -6987 → -6986 → -6985

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 499

Divisors: 1, 2, 7, 14, 499, 998, 3493, 6986

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101101001010

Octal: -15512

Duodecimal: -4062

Hexadecimal: -1b4a

Square: 48804196

Square Root: 83.58229477586745

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 such that the set of parts and the set of multiplicities of parts are disjoint. A114639

Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321. A51402

Smallest value of·such that M(x) = -n, where M(x) is Mertens's function A002321. A51401

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8. A252352

Sphenic numbers (A007304) whose neighbors are sphenic. A248202

Expansion of 1 / ∏_n>=0 (1 - q⁵ⁿ⁺¹)*(1 - q⁵ⁿ⁺³)*(1 - q⁵ⁿ⁺⁴). A107236

Row sums of triangular array T: T(j,k) = k*(j-k)! for k < j, T(j,k) = 1 for k = j; 1 <= k <= j. A129867

a(n) is the number of partitions of n with Durfee square of size <= 2. A330640

Number of labeled nonseparable bipartite graphs on n nodes. A4100

a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2). A26037