13788
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 34944
- Proper Divisor Sum (Aliquot Sum)
- 21156
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4584
- Möbius Function
- 0
- Radical
- 2298
- Omega Function (Ω)
- 5
- 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
- 58
- 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
- Icosahedral numbers: a(n) = n*(5*n^2 - 5*n + 2)/2.at n=17A006564
- Number of homogeneous primitive partition identities of degree 6 with largest part n.at n=15A007344
- Expansion of e.g.f. cos(x)*cos(log(1+x)).at n=9A009097
- Number of self-avoiding polygons of area n with one (self-avoiding polygon) hole on square lattice (not allowing rotations).at n=5A057406
- n*A000084(n).at n=8A058353
- Numbers k such that phi(m) = 96*k+2 has no solution.at n=5A071624
- Solutions y of the Mordell equation y^2 = x^3 - 3a^2 + 1 for a = 0,1,2, ... (solutions x are given by the sequence A000466).at n=12A173202
- Numbers x such that x^2 = y^3 + z (0 < abs(z) < y).at n=48A268510
- a(n) = 9*n^2 + 21*n - 6 (n>=1).at n=37A304374
- G.f.: Sum_{n>=0} (n+1) * (x + x^n)^n.at n=65A325997
- Number of integer partitions of n such that (length) * (maximum) < 2n.at n=47A361852
- Sum of the n-th maximal antirun of odd primes differing by more than two.at n=46A373405
- Number of n-digit numbers where every digit is either a 9 or adjacent to a 9.at n=5A377207