17040
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 53568
- Proper Divisor Sum (Aliquot Sum)
- 36528
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4480
- Möbius Function
- 0
- Radical
- 2130
- Omega Function (Ω)
- 7
- 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
- yes
- 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
- Number of bipartite partitions.at n=18A002762
- Exponential-convolution of triangular numbers with themselves.at n=7A007465
- Engel expansion of log(1/gamma) (where gamma is the Euler-Mascheroni constant A001620) = 0.549539...at n=8A059192
- Numbers n such that p(8n) is prime, where p(n) is the number of partitions of n.at n=28A114168
- Expansion of e.g.f.: exp(x^2)*(exp(2*x)+1)/2.at n=8A122648
- Expansion of 1/(1 - x^4 - x^5 - x^6 + x^10).at n=57A147652
- Coefficients of a recursive polynomial based on Chaitin's S expressions: a(0)=1; a(1)=x; a(2)=1; a(n)=vector(a(n-1)).reverse(a(n-1)).at n=49A176703
- Number of arrangements of n+2 nonzero numbers x(i) in -8..8 with the sum of x(i)*x(i+1) equal to zero.at n=2A188248
- T(n,k)=Number of arrangements of n+2 nonzero numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=47A188249
- Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=7A188251
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 3.at n=36A209986
- Number of 4 X n 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=22A224040
- Number A(n,k) of permutations p on [2n] satisfying p^k(i) = i for all i in [n]; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=33A246072
- a(n) = pi(phi(p(P(n)))) = A000720(A000010(A000041(A000040(n)))).at n=15A247087
- Numbers k such that 3k - 1 divides 3^k - 1.at n=17A273614
- Expansion of Product_{k>0} 1/(1 + x^k)^(k*3).at n=26A279031
- Column 2 of triangle in A288187.at n=11A333279
- a(n) = Sum_{d|n} d * binomial(d+n/d-1, d).at n=44A338658
- Nonnegative numbers m such that if 2^k appears in the binary expansion of m, then k+1 divides m.at n=40A358970
- Expansion of e.g.f. exp( (x / (1-x))^2 ) / (1-x).at n=6A361594