Properties of the Number 29147

Twenty-Nine Thousand One Hundred Forty-Seven

Basics

Value: 29146 → 29147 → 29148

Parity: odd

Prime: Yes

Previous Prime: 29137

Next Prime: 29153

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 29147

Divisors: 1, 29147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000111011011

Octal: 70733

Duodecimal: 14A4B

Hexadecimal: 71db

Square: 849547609

Square Root: 170.72492495239234

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

A Fielder sequence. A1640

O.g.f.: exp( ∑_n>=1 A256357(n²)*xⁿ/n ), where exp( ∑_n>=1 A256357(n)*xⁿ/n ) = 1 + ∑_n>=1 x^n² + x^2·n². A258656

Prime numbers preceded by two consecutive numbers which are products of four distinct primes (or tetraprimes). A361796

Prime(144·n). A102350

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

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

Primes p such that if q is the next prime, the sum (with multiplicity) of prime factors of p² + q² is a square. A359443

Multiplicity of highest weight (or singular) vectors associated with character chi₂₀ of Monster module. A34408

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

Expansion of 1/((1-x²)*(1-x³)*(1-x⁵)*(1-x¹⁰)). A29147