Properties of the Number 26992

Twenty-Six Thousand Nine Hundred Ninety-Two

Basics

Value: 26991 → 26992 → 26993

Parity: even

Prime: No

Previous Prime: 26987

Next Prime: 26993

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 7 × 241

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 56, 112

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100101110000

Octal: 64560

Duodecimal: 13754

Hexadecimal: 6970

Square: 728568064

Square Root: 164.2924222233028

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 inversion sequences avoiding pattern 010. A263779

G.f.: exp( ∑_n>=1 [ ∑_k>=1 (2·k-1)ⁿ * x^k ]ⁿ / n ). A292500

Triangle of coefficients of polynomials u(n,x) jointly generated with A208932; see the Formula section. A208931

Perimeter of the Sierpiński carpet at iteration n. A381517

a(n) = n³ - 8. A259348

G.f.: (1 + x + 3·x² + 11·x³ + 6·x⁴ + 14·x⁵ + 12·x⁶ + 4·x⁷ + 14·x⁸ + 4·x⁹ + 12·x¹⁰ + 14·x¹¹ + 5·x^ 12 + 11·x¹³ + 9·x¹⁴ - 11·x¹⁵)/((1 - x)⁴*(1 - x²)¹²). A268244

E.g.f. A(x) satisfies: [x^n-1] A(x)^n⁴ = [xⁿ] A(x)^n⁴ for n>=1. A296174

L.g.f.: ∑_n>=1 [ ∑_k>=1 (2·k-1)ⁿ * x^k ]ⁿ / n. A292502

Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the upper median minus the minimum of every 2 X 2 subblock equal. A237802

a(n) = ∑_k=0..n-1 T(n,k) * T(n,k+1), with T given by A026692. A26992