17342
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
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 12898
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7392
- Möbius Function
- 1
- Radical
- 17342
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=34A010005
- Numbers k such that sigma(k) = sigma(k+13).at n=8A015883
- Numbers k such that 193*2^k+1 is prime.at n=25A032473
- Multiplicity of highest weight (or singular) vectors associated with character chi_144 of Monster module.at n=40A034532
- Reverse or double: if reverse of a(n) > a(n), then a(n+1) = a(n) reversed, otherwise a(n+1) = 2*a(n).at n=12A041013
- Expansion of 1/((1-x)*(1-x^2)^2*(1-x^3)^2*(1-x^4)^2*(1-x^5)*(1-x^6)).at n=29A045513
- a(1) = 1, a(n+1) = 2 * digit reversal of a(n).at n=9A095197
- Triangular sequence: f(n) = Product[Prime[a]*k + Prime[b], {k,0,n}]; a = 2; b = 1; t(n,m) = Numerator[f(n)/(f(n-m)*f(m))].at n=59A154096
- Triangular sequence: f(n) = Product[Prime[a]*k + Prime[b], {k,0,n}]; a = 2; b = 1; t(n,m) = Numerator[f(n)/(f(n-m)*f(m))].at n=61A154096
- Numbers k such that 16 plus the k-th triangular number is a perfect square.at n=9A154146
- Generalized Markoff numbers: largest of 7-tuple of positive numbers a, b, c, d, e, f, g satisfying the Markoff(7) equation a^2+b^2+c^2+d^2+e^2+f^2+g^2 = 3abcdefg.at n=30A227211
- Antidiagonal sums of A068914.at n=20A334683
- a(0)=1; a(n) = sum of all previous terms, eliminating repeated digits (starting from the left).at n=26A370748
- Number of integer compositions of n whose leaders of anti-runs are weakly increasing.at n=16A374681
- Squarefree numbers k such that k^2 is abundant, and d^2 is nonabundant for any proper divisor d of k.at n=32A381741