9685
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 2915
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7104
- Möbius Function
- -1
- Radical
- 9685
- 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
- 21
- 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
- no
- Odd
- yes
Appears in sequences
- Positions of remoteness 3 in Beans-Don't-Talk.at n=36A005695
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=20A020376
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 21.at n=3A031609
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=17A071863
- Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square.at n=13A088319
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=9A148782
- Values of hypotenuse of primitive Pythagorean triples which can have four different shapes (that is, four different sets of "legs").at n=34A159781
- Composite numbers of form 8n+5 with all prime factors of form 8m+5.at n=38A175486
- Union of A071863 and A071861.at n=36A193458
- Odd numbers producing 4 odd numbers in the Collatz iteration.at n=25A198587
- 20k^2-20k-5 interleaved with 20k^2+5 for k=>0.at n=45A216876
- G.f.: 1 = Sum_{n>=0} a(n) * x^n * Sum_{k=0..2*n+1} binomial(2*n+1,k)^2 * (-x)^k.at n=4A217042
- A triangle formed like generalized Pascal's triangle. The rule is T(n,k) = 2*T(n-1,k-1) + T(n-1,k), the left border is n and the right border is n^2 instead of 1.at n=60A228576
- Expansion of log'(1/2-sqrt((5*x+2*sqrt(1-4*x)-2)/x)/2).at n=6A243280
- Numbers n that are the product of three distinct odd primes and x^2 + y^2 = n has integer solutions.at n=32A264498
- Positions of ones in A264977; positions of twos in A277330.at n=55A277701
- Numbers that are a primitive sum of two squares in more than 2 ways.at n=45A281877
- a(n) = PrimePi(n^3) - PrimePi(n)^3, where PrimePi = A000720.at n=51A291538
- Total number of 0's in all (binary) max-heaps on n elements from the set {0,1}.at n=17A309051
- Expansion of Product_{i>=1, j>=1, k>=1} (1 - x^(i*j*k)).at n=48A319359