11577
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 4839
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7232
- Möbius Function
- -1
- Radical
- 11577
- Omega Function (Ω)
- 3
- 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
- 112
- 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
- Icosahedral numbers: a(n) = n*(5*n^2 - 5*n + 2)/2.at n=16A006564
- a(n) = T(2n-1,n), where T is the array in A026098.at n=48A026102
- Numbers k such that sigma(k) = phi(k*bigomega(k)+1).at n=40A067876
- Numbers k such that sigma(k) = phi(k*omega(k)+1).at n=41A067879
- Structured deltoidal hexacontahedral numbers (vertex structure 9).at n=8A100166
- a(n) = n*(n+1)*(14*n-11)/6.at n=17A172076
- Difference between 10^n and the first prime of gap 6 > 10^n.at n=52A227435
- Positions of 3's in A234323.at n=13A234804
- Number of length 4+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=27A248437
- Number of primes in A065381 less than 10^n.at n=5A255816
- Number of binary strings with n zeros and n ones avoiding the substrings 10101101 and 1110101.at n=8A275046
- Numbers n such that 13^n is the highest power of 13 dividing A240751(n).at n=7A286007
- Numbers k such that 479*2^k+1 is prime.at n=18A319488
- Partial sums of A224613.at n=38A365446
- The smallest positive number such that sopfr(|a(n) - n|) = sopfr(a(n) + n) and Omega(|a(n) - n|) = Omega(a(n) + n), where sopfr(k) is the sum of the primes dividing k, with repetition.at n=32A370504
- Number of integer partitions of n with a unique prime part.at n=50A379304