Properties of the Number 29416

Twenty-Nine Thousand Four Hundred Sixteen

Basics

Value: 29415 → 29416 → 29417

Parity: even

Prime: No

Previous Prime: 29411

Next Prime: 29423

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 3677

Divisors: 1, 2, 4, 8, 3677, 7354, 14708, 29416

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111001011101000

Octal: 71350

Duodecimal: 15034

Hexadecimal: 72e8

Square: 865301056

Square Root: 171.51093259614677

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

Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 7 (most significant digit on right and removing all least significant zeros before concatenation). A29524

Numbers k for which 6k+1, 24k+5, 432k²+72k-1, and 432k²+90k-1 are all prime. A175513

a(n) is the smallest integer that makes A230762(n) the commonest number of decompositions of 2k into an unordered sum of two odd primes, where 3 <= k <= a(n). A230822

Number of length n+2 0..3 arrays with at most one downstep in every n consecutive neighbor pairs. A258732

Number of n X 7 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281204

arcsinh(arcsin(x)+sin(x))=2·x-8/3!*x³+298/5!*x⁵-29416/7!*x⁷... A12918

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281205

T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs. A258730

Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 5 6 or 7. A252507

Expansion of 1/((1-x⁶)(1-x⁷)(1-x⁸)(1-x¹²)). A29416