11571
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19200
- Proper Divisor Sum (Aliquot Sum)
- 7629
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 1
- Radical
- 11571
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Centered dodecahedral numbers.at n=10A005904
- Expansion of Product_{k>=1} (1 - x^k)^14.at n=22A010821
- Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of universal W-group W(3).at n=16A014696
- Numbers k that divide s(k), where s(1)=1, s(j)=7*s(j-1)+j.at n=44A014854
- Number of 6's in all partitions of n.at n=37A024790
- a(n) = (2*n - 1)*(3*n + 1).at n=44A033569
- a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i.at n=33A045973
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=43A053720
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.at n=15A071141
- Numbers n such that (i) the sum of the distinct primes dividing n is divisible by the largest prime dividing n and (ii) n has exactly 4 distinct prime factors and (iii) n is squarefree.at n=4A071143
- Squarefree numbers k such that the largest prime factor of k is equal to the sum of the other prime factors of k.at n=15A071312
- Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4 and v3 <= v4.at n=8A085462
- Dimensions of the irreducible representations of the simple Lie algebra of type G2 over the complex numbers, listed in increasing order.at n=41A104599
- Wiener index of a benzenoid consisting of a chain of n hexagons characterized by the encoding s = 1133 (see the Gutman et al. reference, Sec. 5).at n=12A193399
- 7 times hexagonal numbers: a(n) = 7*n*(2*n-1).at n=29A195320
- Polylogarithm li(-n,-7/10) multiplied by (17^(n+1))/10.at n=4A213152
- Numbers n such that the sum of the distinct prime divisors of n that are congruent to 1 mod 4 equals the sum of the distinct prime divisors congruent to 3 mod 4.at n=4A215949
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array.at n=18A219621
- Composite squarefree numbers n such that p(i)-9 divides n+9, where p(i) are the prime factors of n.at n=37A225709
- Denominators of rationals with e.g.f. D(4,x), a Debye function.at n=54A227574