11635
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 3485
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8544
- Möbius Function
- -1
- Radical
- 11635
- 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
- 143
- 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
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5).at n=34A039839
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=8A076164
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 5 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=9A112563
- Number of odd parts in all partitions of n into distinct parts.at n=51A116676
- Triangle, read by rows, equal to P^5, where triangle P = A135880.at n=16A135892
- Triangle, read by rows, equal to R^2, the matrix square of R = A135894.at n=23A135895
- a(n) = count of monomials, of degrees k=0 to n, in the complete homogeneous symmetric polynomials h(mu,k) summed over all partitions mu of n.at n=5A209667
- Number of n X 5 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=6A223774
- Number of nX7 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=4A223776
- Number of partitions of n that sorted in increasing order contain a part k in position k for some k.at n=34A238395
- Expansion of Product_{k>=1} (1 + (x*(1 - x))^k).at n=24A307501
- a(n) = Sum_{j=1..n} Sum_{k=1..n} tau(j*k).at n=32A372674
- Number of solid partitions of n such that all parts occur with the same multiplicity.at n=15A379278