Properties of the Number 27986

Twenty-Seven Thousand Nine Hundred Eighty-Six

Basics

Value: 27985 → 27986 → 27987

Parity: even

Prime: No

Previous Prime: 27983

Next Prime: 27997

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 1999

Divisors: 1, 2, 7, 14, 1999, 3998, 13993, 27986

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 110110101010010

Octal: 66522

Duodecimal: 14242

Hexadecimal: 6d52

Square: 783216196

Square Root: 167.29016707505556

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

G.f.: ∏_m>0 (1 + x^m + 2!*x^2·m + 3!*x^3·m). A289485

McKay-Thompson series of class 25A for Monster. A58594

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 absolute value of x(i,j)-x(i-1,j) in the j direction. A250781

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

Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7. A251887

Number of nX4 0..1 arrays with every element unequal to 0, 1, 2 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318071

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

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250783

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318075

a(n) = ∑_k=0..2·n-2 T(n, k)*T(n, k+2), T given by A027960. A27986