11695
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 2345
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9352
- Möbius Function
- 1
- Radical
- 11695
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_141 of Monster module.at n=39A034529
- Number of partitions satisfying (cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=42A036802
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(2,5) + cn(3,5).at n=34A039845
- Smaller of Smith brothers.at n=8A050219
- a(n) = A048141(3*n).at n=49A051061
- Numbers k such that the Lucas Aurifeuillian primitive part A of Lucas(k) is prime.at n=44A061442
- a(1)=1; a(2)=2; a(3)=3; a(n) = Sum_{k=3..n-1} (a(k) + a(k-1) + a(k-2)).at n=11A078344
- Table T(n,k) = sum over all set partitions of n of number at index k.at n=33A120057
- Number of strings of numbers x(i=1..5) in 0..n with sum i^4*x(i) equal to 625*n.at n=50A184351
- Number of partitions of n into parts with an odd number of distinct prime divisors.at n=54A285799
- Number of Dyck paths of semilength n such that no positive level has fewer than ten peaks.at n=23A288686
- Expansion of Product_{k>0} (1 + Sum_{m>0} x^(k*m!)).at n=43A304332
- Consecutive states of the linear congruential pseudo-random number generator 172*s mod 30307 when started at s=1.at n=37A385032