11684
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21504
- Proper Divisor Sum (Aliquot Sum)
- 9820
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5544
- Möbius Function
- 0
- Radical
- 5842
- Omega Function (Ω)
- 4
- 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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=39A015850
- Number of ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=33A068924
- Numbers k such that (2*k)!/(2*k!)-1 is prime.at n=19A091907
- Weight distribution of [127,36,31] primitive binary BCH code.at n=36A151813
- Number of binary strings of length n with no substrings equal to 0001 or 0100.at n=16A164394
- Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=9A209346
- Difference between sum of largest parts and sum of smallest parts of all partitions of n into an odd number of parts.at n=27A211870
- a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) =2, a(1) = 3, a(2) = 5.at n=52A214331
- Numbers of the form (7^j + 9^k)/2, for j and k >= 0.at n=29A226795
- Number of n X 2 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=8A240389
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=53A240394
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) is not a part of p.at n=36A241736
- Total length of self-avoiding walks with n bonds on the square lattice with additional bridges of length 1.at n=6A259814
- Numbers n such that x^n * (x+1)^(n-1) + 1 is irreducible over GF(2).at n=19A268274
- The Padovan sequence A000931 doubled.at n=37A291289
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=36A295865
- Number of compositions (ordered partitions) of n into prime power parts (A246655) such that no two adjacent parts are equal (Carlitz compositions).at n=27A301501
- Number of tree-partitions of a multiset whose multiplicities are the prime indices of n.at n=44A318847
- Number of parts in all partitions of n in which no part occurs more than five times.at n=25A320608
- Numbers k such that phi(k) < phi(k+1) < phi(k+2) < phi(k+3) where phi is the Euler totient function (A000010).at n=24A327880