Properties of the Number 29415

Twenty-Nine Thousand Four Hundred Fifteen

Basics

Value: 29414 → 29415 → 29416

Parity: odd

Prime: No

Previous Prime: 29411

Next Prime: 29423

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 37 × 53

Divisors: 1, 3, 5, 15, 37, 53, 111, 159, 185, 265

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111001011100111

Octal: 71347

Duodecimal: 15033

Hexadecimal: 72e7

Square: 865242225

Square Root: 171.50801730531433

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..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero. A232076

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302381

T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302953

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303102

T(n,k)=Number of nXk 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) (1,0) or (1,1), with upper left element zero. A278208

Triangle read by rows: T(n,g) = number of general immersions of a circle with n crossings in a surface of arbitrary genus g (the circle is not oriented, the surface is not oriented). A260914

Number of (1+1) X (n+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero. A232077

The number of permutations of length n sortable by 2 reversals. A228396

a(0)=1, a(1)=5, a(n) = 20·a(n-2) - a(n-1). A165470

Records in A087669. A192230