11529
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19840
- Proper Divisor Sum (Aliquot Sum)
- 8311
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- 0
- Radical
- 1281
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = 5^n - 4^n.at n=6A005060
- Nexus numbers (n+1)^6 - n^6.at n=4A022522
- Expansion of 1/((1-2x)(1-3x)(1-4x)(1-7x)).at n=4A025445
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) = cn(3,5)).at n=51A036815
- Numbers ending with '9' that are the difference of two positive cubes.at n=37A038864
- Square array of nexus numbers a(n,k) = (n+1)^(k+1) - n^(k+1) (n >= 0, k >= 0) read by upwards antidiagonals.at n=50A047969
- n plus a googol is prime.at n=34A049014
- 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=21A064201
- a(1) = 1, a(n) = a(n-1) + phi(a(n-1)).at n=18A074693
- a(n) = n*n^n - (n-1)*(n-1)^n.at n=5A085283
- Triangular array formed by the little Schröder numbers s(n,k).at n=30A110440
- a(1) is the least k such that p(1) = (k*3)^2 + k*3 - 1 is prime, then a(n+1) is the least k such that (k*p(n))^2 + k*p(n) - 1 = p(n+1) is prime.at n=13A120392
- Odd winning positions in Fibonacci nim.at n=21A120904
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DDUU's starting at level 2.at n=22A135329
- Number of Dyck paths of semilength n having no DDUU's starting at level 2.at n=10A135335
- 4-Stirling numbers of the second kind.at n=22A143496
- E.g.f. S(x) satisfies: S(x) = Integral [1 - 2*S(x)^2]^(3/4) dx with S(0)=0.at n=4A159601
- Triangular array T(n,k): The differences in the columns of A174551.at n=22A174552
- Coefficients of Maclaurin series for (1-9x-9x^2)^(-1/3).at n=5A180400
- Difference of two positive 6th powers.at n=7A181125