Properties of the Number 29216

Twenty-Nine Thousand Two Hundred Sixteen

Basics

Value: 29215 → 29216 → 29217

Parity: even

Prime: No

Previous Prime: 29209

Next Prime: 29221

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁵ × 11 × 83

Divisors: 1, 2, 4, 8, 11, 16, 22, 32, 44, 83

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001000100000

Octal: 71040

Duodecimal: 14AA8

Hexadecimal: 7220

Square: 853574656

Square Root: 170.92688495377197

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

p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = (1 - S²). A289918

a(n) = ∑_{k=0..floor(n/2)} binomial(4·k,n-2·k). A375314

Expansion of 1 / ((1-x)² - x⁶). A392541

Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A008292(n·k + 1, n-k) if k <= n otherwise A008292(n*(n-k), k), read by rows. A157117

Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions. A186853

p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - S)(1 + S²). A291741

Triangle, read by rows, T(n, k) = 2·A123125(n-1, k), for n >= 2, otherwise T(n, 0) = T(n, n) = -1, with T(0, 0) = T(1, 0) = 1. A141591

Coefficients of the derivatives of the Eulerian polynomials (with indexing as in A173018). A142706

Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5. A254830

Number of biconnected triangle-free graphs on n nodes with chromatic number 3. A126756