13101
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19104
- Proper Divisor Sum (Aliquot Sum)
- 6003
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- -1
- Radical
- 13101
- Omega Function (Ω)
- 3
- 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
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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) = (n-1)*(n-2)^3 - A003878(n-3), with a(1) = a(2) = 0 and a(3) = 2.at n=27A075681
- Number of partitions of n such that the least part occurs exactly twice.at n=44A096373
- 4-Smith numbers.at n=13A103125
- Sum of first 2n primes.at n=38A109722
- Nonnegative k such that 3*k + 1 is a perfect cube.at n=11A121628
- Number of unordered rooted trees where each subtree from given node has the same number of nodes.at n=28A127524
- an=n-th smallest integer m=p1*p2*p3, product of 3 odd primes such that d+2m/d are all primes for d dividing 2m.at n=12A128278
- a(n) = floor(n^3/3).at n=34A131476
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 110-111-100 pattern in any orientation.at n=12A146186
- a(n) = 1331*n - 209.at n=9A157444
- Numbers k such that 6*prime(k) -+ {1,5} are all prime.at n=21A174393
- Binary XOR of 5^k as k varies from 0 to n.at n=6A199399
- Number of 0..n arrays x(0..8) of 9 elements with zero 4th differences.at n=47A200445
- Number of (w,x,y) with all terms in {0,...,n} and 2*w < |x+y-w|.at n=33A213396
- Numbers such that Liouville's function (A002819) and the little omega analog to Liouville's function (A174863) are equal.at n=33A224987
- Terms of A007504 divisible by 3.at n=22A249679
- Numbers in A007504 such that omega(a(n)) = Omega(a(n)) = 3.at n=15A264885
- Number of nX7 0..1 arrays with every element unequal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=11A317740