Properties of the Number 29428

Twenty-Nine Thousand Four Hundred Twenty-Eight

Basics

Value: 29427 → 29428 → 29429

Parity: even

Prime: No

Previous Prime: 29423

Next Prime: 29429

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 7 × 1051

Divisors: 1, 2, 4, 7, 14, 28, 1051, 2102, 4204, 7357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001011110100

Octal: 71364

Duodecimal: 15044

Hexadecimal: 72f4

Square: 866007184

Square Root: 171.54591222177228

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

Expansion of g.f.: exp( ∑_n>=1 A002203(n)² * xⁿ/n ) where A002203 are the companion Pell numbers. A204062

G.f.: 2·q * ∏_n>=1 (1 + q^2·n)/((1 + qⁿ)*(1 + q^2·n-1)*(1 + q^4·n)) in powers of q. A293132

G.f. A(x) satisfies: A(x) = 1 - x·A(x/(1 - x)) / (1 - x)⁵. A346060

Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - x²/2*(exp(x) - 1)) ). A370991

a(n) is the number of zeros needed to write the integers 1 through Fibonacci(n). A155881

Number of nX2 binary arrays with the number of 0-1 adjacencies equal to the number of 0-0 adjacencies. A183257

Subsequence of lesser of 2 terms of A095301 that are 2 apart. A248083

T(n,k)=Number of nXk binary arrays with the number of 0-1 adjacencies equal to the number of 0-0 adjacencies. A183262

Expansion of 1/((1-x⁶)(1-x⁹)(1-x¹⁰)(1-x¹¹)). A29428