17116
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 32760
- Proper Divisor Sum (Aliquot Sum)
- 15644
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7760
- Möbius Function
- 0
- Radical
- 8558
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 79
- 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
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 0, 1, 1, 0.at n=23A025250
- Trajectory of 3 under map n->15n+1 if n odd, n->n/2 if n even.at n=17A037105
- Numbers n such that there exists at least one number j and pi(m) = d_1 d_2 ... d_j*d_(j+1) d_(j+2) ... d_k where d_1 d_2 ...d_k is the decimal expansion of n.at n=23A112012
- Sum of the sizes of the Durfee squares of all partitions of n.at n=30A115995
- Number of (n+2) X (n+2) binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=2A202890
- Number of (n+2)X5 binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=2A202893
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows, columns and nw-to-se diagonals.at n=12A202898
- Twice the large Schroeder numbers A006318.at n=7A238111
- Expansion of 1 - x*(1+x)/(1 + x^2*(1-x^2)/(1 - x^3*(1+x^3)/(1 + x^4*(1-x^4)/(1 - x^5*(1+x^5)/(1 - ...))))), a continued fraction.at n=49A291200
- Positive integers that have exactly ten representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=9A317400
- The n-th positive integer that has exactly n representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=9A317537
- Numbers k such that 30*k - 1, 30*k + 1, 30*k^2 - 1 and 30*k^2 + 1 are all prime.at n=29A359184
- Expansion of 1/( Product_{k=0..6} (1 - (7*k+1) * x) )^(1/7).at n=3A383630