17302
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26712
- Proper Divisor Sum (Aliquot Sum)
- 9410
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- -1
- Radical
- 17302
- 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
- 53
- 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
- Coordination sequence for sigma-CrFe, Position Xf.at n=33A009958
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=9A049062
- a(n) = T(n,2), array T as in A054134.at n=11A054136
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to six complementary pairs of ratios which generate simple musical tones (scale steps): 8/7 and 7/4, 6/5 and 5/3, 16/13 and 13/8, 5/4 and 8/5, 4/3 and 3/2 and 11/8 and 16/11.at n=47A060233
- Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=3A094063
- Number of permutations of 1..n with all sums of 2 through 4 adjacent terms respectively unique.at n=8A147726
- Number of permutations of 1..n with all sums of 2 through 5 adjacent terms respectively unique.at n=8A147727
- Number of permutations of 1..n with all sums of 2 through 6 adjacent terms respectively unique.at n=8A147728
- Number of permutations of 1..n with all sums of 2 through 7 adjacent terms respectively unique.at n=8A147729
- Number of permutations of 1..n with all sums of 2 through 8 adjacent terms respectively unique.at n=8A147730
- a(n) = (1/50)*((15*n^2-20*n+4)*Fibonacci(n) - (5*n^2-6*n)*A000032(n)).at n=16A224227
- a(n) = n*(21*n-17)/2.at n=41A226491
- Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than 2 times.at n=7A248836
- T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than k times.at n=34A248842
- Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime.at n=24A279072
- Numbers k such that Bernoulli number B_{k} has denominator 498.at n=24A282773
- a(n) = Sum_{i=1..n, j=1..n, gcd(i,j)=1} i.at n=37A333297
- Number of partitions of [n] into blocks whose element sum is <= n.at n=14A375099