17322
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 34656
- Proper Divisor Sum (Aliquot Sum)
- 17334
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5772
- Möbius Function
- -1
- Radical
- 17322
- Omega Function (Ω)
- 3
- 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
- 48
- 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(n) = Sum_{k >= 1} floor(3*tau^(n-k)).at n=16A020958
- Number of partitions of n into parts not of the form 13k, 13k+2 or 13k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 5 are greater than 1.at n=44A035950
- Partial sums of A001676.at n=16A178579
- Number of (w,x,y,z) with all terms in {1,...,n} and w^3<=x^3+y^3+z^3.at n=12A212098
- Number of length 3 1..(n+2) arrays with no leading or trailing partial sum equal to a prime.at n=40A254206
- p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - S)^2.at n=19A291725
- Number of partitions p of n such that min(p) < (number of parts of p) < max(p).at n=39A325340
- First index k where A366574(k) = n.at n=24A366724
- G.f.: Sum_{k>=0} 2^k * x^(k^2) / Product_{j=1..k} (1 - x^j).at n=47A376948