13560
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 41040
- Proper Divisor Sum (Aliquot Sum)
- 27480
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 0
- Radical
- 3390
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 182
- 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
- Shifts left under "CHJ" (necklace, identity, labeled) transform.at n=7A032333
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 3 (mod 5).at n=49A035567
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=19A050781
- Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.at n=26A070756
- Numbers k such that A000010(k) divides A074639(k).at n=47A074645
- Differences between two successive prime powers of prime numbers (A076707) in more than one way.at n=36A077257
- Differences between two successive powers of a prime but not a prime (A025475) in more than one way.at n=37A077274
- Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=19A078108
- Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1.at n=30A079161
- Number of non-commuting permutations: number of ordered pairs g, h in Symm(n) such that gh <> hg, i.e., the subgroup <g,h> is non-Abelian.at n=4A086501
- Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways.at n=38A092000
- Triangle read by rows: T(n,k) = number of unique-valued sequences of length k, n >= 1, 1 <= k <= 2n-3, in the symmetric group S_n.at n=11A097635
- Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 81 for n > 0.at n=6A101952
- a(n) = 4*n^3 + 4*n.at n=15A105374
- Poincaré series [or Poincare series] P(C_{4,2}(0); t).at n=18A124637
- Number of circular permutations of the multiset {1,1,2,2,...,n,n} (up to rotations) with even distances between equal elements.at n=5A137737
- Number of circular permutations of the multiset {1,1,2,2,...,2n,2n} (up to rotations) with even distances between equal elements.at n=2A137749
- Number of ON cells at n-th stage of three-dimensional version of the cellular automaton A160410, using cubes.at n=15A160428
- Number of "ON" cubic cells at n-th stage in simple 3-dimensional cellular automaton: a(n) = A160428(n)/8.at n=30A161342
- Number of Dyck paths of semilength n, having no ascents and no descents of length 1, and having no peaks at odd level.at n=19A167635