13189
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14630
- Proper Divisor Sum (Aliquot Sum)
- 1441
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11880
- Möbius Function
- 0
- Radical
- 1199
- Omega Function (Ω)
- 3
- 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
- 125
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (1/2)*s(n+3), where s = A025248.at n=12A025249
- Second diagonal of A027517.at n=8A027523
- Numbers k such that sigma(k+1) = 2*phi(k).at n=11A067260
- Expansion of (1 - x - sqrt(1 - 2*x + x^2 - 8*x^3)) / (4*x^2) in powers of x.at n=14A091565
- a(n) = n^4 - n^3 - n^2.at n=11A132998
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, -1, 0), (0, 1, -1), (1, 0, 1)}.at n=9A148794
- Second beta integer combination triangle of a Narayana type: a=3:f(n, a) = a*f(n - 1, a) + f(n - 2, a);c(n,a)=If[n == 0, 1, Product[f(i, a), {i, 1, n}]];w(n,m,q)=c(n - 1, q)*c(n, q)/(c(m - 1, q)*c(n - m, q)*c(m - 1, q)*c(n - m + 1, q)*f(m, q)).at n=12A172378
- a(n) = 109*n^2.at n=11A174339
- Total sum of parts of multiplicity 10 in all partitions of n.at n=41A222738
- Number of ordered triples (i,j,k) with |i|, |j|, |k|, |i*j*k| <= n.at n=30A226359
- Product between n-th prime and next perfect square.at n=28A229497
- Numbers such that the sequence of all possible sums of divisors of n is increasing but not strictly so, the sums being ordered by their characteristic functions, seen as binary numbers (see example).at n=9A230492
- Semiperimeters s of primitive Pythagorean triples (a, b, c) where a, b, c and s are not squarefree.at n=26A237620
- S_5 sequence in partition of integers > 1 described in A240521.at n=34A240522
- G.f.: M(F(x)) is a power series in x consisting entirely of positive integer coefficients such that M(F(x) - x^k) has negative coefficients for k>0, where M(x) = 1 + x*M(x) + x*M(x)^2 is the g.f. of the Motzkin numbers A001006.at n=27A251571
- Numbers k such that (77*10^k - 59)/9 is prime.at n=21A294489
- Number of partitions of n with eight parts in which no part occurs more than twice.at n=37A320596
- Number of integer partitions of n into an odd number of parts, the greatest of which is odd.at n=41A340385
- Numbers k for which the 3-adic valuations of k and sigma(k) are equal, and that also satisfy Euler's criterion for odd perfect numbers (see A228058).at n=48A349755
- a(n) is the number of ways to write prime(n) as a sum of distinct composites.at n=29A381251