13060
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27468
- Proper Divisor Sum (Aliquot Sum)
- 14408
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5216
- Möbius Function
- 0
- Radical
- 6530
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- Second elementary symmetric function of 3,4,...,n+3.at n=14A024183
- a(n) = Sum_{1 <= x, y <= n} lcm(x, y).at n=15A064951
- Total number of parts in all partitions of n into odd parts.at n=40A067588
- Expansion coefficients of the solution of a functional equation.at n=13A107902
- Row sums of A163334 and A163336 divided by 6.at n=40A163479
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 1.at n=37A259577
- Number T(n,k) of compositions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=26A261781
- Numbers x = concat(a,b) such that b^a begins with the digits of x.at n=11A266817
- Numbers n such that A099953(n) = Sum_{i=1..n-1} (2i-1)!! is prime.at n=7A284123
- Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=21A290040
- Number of compositions of n where each part i is marked with a word of length i over a quinary alphabet whose letters appear in alphabetical order and all five letters occur at least once in the composition.at n=1A293582
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=43A306301
- a(n) is the sum of A023896(k) over the totatives of n.at n=54A307997
- Number of integer partitions with sum < n whose distinct parts cannot be linearly combined using all positive coefficients to obtain n.at n=46A365323