17010
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 52416
- Proper Divisor Sum (Aliquot Sum)
- 35406
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 210
- Omega Function (Ω)
- 8
- 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
- 84
- 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) = floor(n(n+2)(2n+1)/8).at n=40A002717
- Denominators of expansion of -W_{-1}(-e^{-1-x^2/2}) where W_{-1} is Lambert W function.at n=6A005446
- Area of more than one Pythagorean triangle.at n=15A009127
- Expansion of 1/(1-3*x)^7; 7-fold convolution of A000244 (powers of 3).at n=4A036220
- Take n-th palindromic prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.at n=36A052507
- Take n-th palindromic prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.at n=37A052507
- 3^(n-3)*n*(n-1)*(n-2).at n=7A052791
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=24A064114
- Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.at n=24A076482
- Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).at n=29A078937
- Area of the Pythagorean triangle a = u^2 - v^2 (cf. A096382) when u=3, v=4,4,5,...at n=14A096383
- a(n) = 3^4 * binomial(n+3, 4).at n=6A102741
- Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 1 (n >= 0, k >= 0).at n=31A120981
- a(n) = product of terms in n-th row of triangle A126571.at n=4A126574
- Second column of PE^2.at n=7A129323
- Numbers such that the digital sums in bases 2, 3, 5 and 7 all are equal.at n=18A135127
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=11.at n=9A135196
- a(n) = n*(n+1)*(4*n+1)/2.at n=20A135713
- Triangle t(n,m) read by rows: t(n,m) = binomial(n,m)*3^m if m <= n/2, else t(n,m) = t(n,n-m).at n=61A144470
- Triangle t(n,m) read by rows: t(n,m) = binomial(n,m)*3^m if m <= n/2, else t(n,m) = t(n,n-m).at n=59A144470