Properties of the Number 29366

Twenty-Nine Thousand Three Hundred Sixty-Six

Basics

Value: 29365 → 29366 → 29367

Parity: even

Prime: No

Previous Prime: 29363

Next Prime: 29383

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 14683

Divisors: 1, 2, 14683, 29366

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001010110110

Octal: 71266

Duodecimal: 14BB2

Hexadecimal: 72b6

Square: 862361956

Square Root: 171.36510730017358

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231263

Largest number which requires n iterations of the unitary totient function (A047994) to reach 1. A225172

Number of irredundant sets in the n X n rook complement graph. A291622

a(n) = coefficient of xⁿ in A(x) where 1 = ∑_n=-oo..+oo (2·x + (-x)ⁿ*A(x)ⁿ)ⁿ. A359673

Numerators of continued fraction convergents to sqrt(329). A41620

Number of (n+1) X (3+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231258

Number of (5+1)X(n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231267

G.f. A(x) satisfies 1 = ∑_n=-oo..+oo (A(x)ⁿ - 2·x)ⁿ. A378829

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, 0), (1, 0, -1), (1, 0, 1)}. A150266

Array read by antidiagonals: T(n,m) is the number of irredundant sets in the n X m rook complement graph. A384124