Properties of the Number 29964

Twenty-Nine Thousand Nine Hundred Sixty-Four

Basics

Value: 29963 → 29964 → 29965

Parity: even

Prime: No

Previous Prime: 29959

Next Prime: 29983

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 11 × 227

Divisors: 1, 2, 3, 4, 6, 11, 12, 22, 33, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010100001100

Octal: 72414

Duodecimal: 15410

Hexadecimal: 750c

Square: 897841296

Square Root: 173.10112651279886

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

Column of Motzkin triangle. A5322

a(n) = A188491(n-1) + A188495(n-1) + A188497(n-1). A188493

E.g.f. satisfies A(x) = 1 - x·A(x)³*log(1 - x·A(x)²). A371230

Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis from above (i.e., d steps hitting the x-axis). A109195

Expansion of -(1 - 16·x)^1/2 / (1 + 8·x)^1/4. A349845

Greatest number in row of n array T given by A026300. A26938

G.f.: Product((1+xⁱ)/(1-xⁱ),i=1..n-1)/(1-xⁿ), with n = 8. A91779

Triangle read by rows: T(n,k) is the number of short bushes with n edges and having the leftmost leaf at height k (a short bush is an ordered tree with no nodes of outdegree 1). A106489

Irregular triangle read by rows: T(n,m) = number of lattice paths of type {A^Q}_R terminating at point (n, m). A291082

Palindromic in bases 7 and 10. A29964