11004
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29568
- Proper Divisor Sum (Aliquot Sum)
- 18564
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3120
- Möbius Function
- 0
- Radical
- 5502
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- yes
- Odd
- no
Appears in sequences
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=47A002569
- Molien series for A_11.at n=36A008634
- Number of partitions of n into at most 11 parts.at n=36A008640
- a(n) = T(n,n), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n)=0.at n=13A026537
- A variant of the recurrence for A001190.at n=20A038751
- Denominators of continued fraction convergents to sqrt(788).at n=3A042519
- Triangle of coefficients of certain Sheffer-polynomials.at n=33A048870
- Number of mobiles (circular rooted trees) with n nodes and 4 leaves.at n=12A055342
- a(n) = 2*n*(2*n^2 + 1).at n=14A061804
- Row sums of triangle A074135.at n=27A074132
- Sum of terms in each group in A074147.at n=27A074149
- Sums of members of groups in A076063.at n=27A076066
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.at n=9A077096
- a(1) = 15; then numbers obtained at every stage of division by 3 in the following process: multiply by 3, reverse the digits, divide by 3, reverse the digits, multiply by 3, reverse the digit, divide by 3.at n=4A083823
- Coefficients of the D-Dyson mod 27 identity.at n=38A104504
- Numbers beginning with a vowel in French.at n=6A118557
- Expansion of x*(2-4*x^2-x^3)/((1-x)^2*(1-x-x^2)).at n=19A133931
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=36A135441
- a(n) = 441*n^2 - 21.at n=4A145678
- a(n) = 25*n^2 - n.at n=20A157514