Properties of the Number 11529

Eleven Thousand Five Hundred Twenty-Nine

Basics

Value: 11528 → 11529 → 11530

Parity: odd

Prime: No

Previous Prime: 11527

Next Prime: 11549

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 7 × 61

Divisors: 1, 3, 7, 9, 21, 27, 61, 63, 183, 189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10110100001001

Octal: 26411

Duodecimal: 6809

Hexadecimal: 2d09

Square: 132917841

Square Root: 107.37318100903968

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

Square array of nexus numbers a(n,k) = (n+1)^k+1 - n^k+1 (n >= 0, k >= 0) read by upwards antidiagonals. A47969

Nexus numbers (n+1)⁶ - n⁶. A22522

a(n) = 5ⁿ - 4ⁿ. A5060

4-Stirling numbers of the second kind. A143496

E.g.f. C(x) satisfies: C(x) = (1 - 2·S(x)²)^1/4, where S'(x) = C(x)³ and C'(x) = -S(x) with C(0)=1. A159600

Coefficients of Maclaurin series for (1-9x-9x²)^-1/3. A180400

E.g.f.: sqrt(2)*(L/π) / (1 + 2*∑_n>=1 cosh(2*π*n·x/L)/cosh(n*π)) where L = Lemniscate constant. A193544

Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence. A327321

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000011. A259894

E.g.f.: sqrt(2)*L / (π*(1 + 2*∑_n>=1 cos(2*π*n·x/L)/cosh(n*π) )) where L = Lemniscate constant. A193541