11687
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 1753
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- -1
- Radical
- 11687
- 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
- 68
- 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
- Numerator of 2^n*(3*n-3)!/( ((n-1)!)^3 * (2*n)! ).at n=11A004677
- a(n) = c(prime(n))/prime(n), where c = Perrin sequence A001608 (starting 0,2,3,...) and prime(n) is the n-th prime.at n=14A014981
- Inverse Euler transform of A000931.at n=46A018243
- Fibonacci sequence beginning 0, 31.at n=14A022365
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=19A045277
- Numbers k such that phi(k)*d(k) is a multiple of sigma(k), where d(k) is the number of divisors of k.at n=41A050934
- Numbers k such that 4*phi(k) = 3*sigma(k).at n=3A065819
- Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)).at n=25A076660
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={0}.at n=14A080012
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=39A108157
- Number of irreducible multiple zeta values at weight n.at n=46A113788
- Number of unlabeled maximal independent sets in the n-cycle graph.at n=46A127687
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=34A181881
- a(n) = n*(14*n-3).at n=29A185019
- a(n) = (A212146(n)-1)/2.at n=18A212147
- a(n) = floor((n+1)*(n-3)*(n-4)/12).at n=54A212772
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 2 ("abcdefg" scheme: bits represent segments in clockwise order).at n=27A234692
- Numbers k such that 3*10^k + 17 is prime.at n=20A283684
- Chromatic invariant on the n-triangular honeycomb obtuse knight graph.at n=5A295194
- Number of nX5 0..1 arrays with every element equal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=9A298657