13706
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 12214
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 1
- Radical
- 13706
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- yes
- Odd
- no
Appears in sequences
- Number of terms in 5th derivative of a function composed with itself n times.at n=20A022815
- Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=42A035946
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) and cn(0,5) + cn(2,5) <= cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(3,5) <= cn(4,5).at n=46A039883
- Integer part of log(n^n)^log(n).at n=13A062431
- Nearest integer to log(n^n)^log(n).at n=13A062432
- Sum(j=1,n,floor(A000041(j)/j)).at n=44A086736
- Sums of the products of n consecutive pairs of numbers.at n=21A135036
- a(n) = 686*n - 14.at n=19A157363
- G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..2*n} A027907(n,k)^2 * x^k * A(x)^k]* x^n/n ), where A027907 is the triangle of trinomial coefficients.at n=9A199248
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 3,2,0,1,0,0,0 for x=0,1,2,3,4,5,6.at n=4A203211
- G.f.: Product_{n>=1} (1 + Lucas(n)*x^n + (-1)^n*x^(2*n)) where Lucas(n) = A000204(n).at n=14A203801
- Number of (w,x,y) with all terms in {0,...,n} and |w-x| < |x-y| < |y-w|.at n=44A212964
- Number of nondecreasing -3..3 vectors of length n whose dot product with some nonincreasing -3..3 vector equals n.at n=11A226394
- Numbers n such that if x=sigma(n)-tau(n)-n then n=sigma(x)-tau(x)-x.at n=19A238227
- Number of length 1+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.at n=12A245951
- Consider any concatenation of the type n = concat(a,b). Sequence lists numbers that are the sum of the products of some of such couples a and b.at n=24A265737
- G.f.: Sum_{k>=0} x^(k^3) / Product_{j=1..k^3} (1 - x^j).at n=50A334626
- Digitally balanced numbers (A031443) whose squares and cubes are also digitally balanced.at n=3A353140
- Expansion of (1/x) * Series_Reversion( x / (1 + x^3 / (1 - x)^5) ).at n=11A389252