9690
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 16230
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- -1
- Radical
- 9690
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 73
- 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..n-1} k*sigma(k)*sigma(n-k).at n=14A000441
- Fermat coefficients.at n=6A000973
- a(n) is the number of alpha-labelings of graphs with n edges.at n=8A005193
- a(n) = floor(binomial(n,7)/8).at n=20A011844
- a(n) is least k such that k and 10k are anagrams in base n (written in base 10).at n=7A023102
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=37A023865
- Theta series of A*_19 lattice.at n=64A023931
- Areas of right triangles with coprime integer sides.at n=42A024365
- Ordered areas of primitive Pythagorean triangles.at n=45A024406
- Perimeters of more than one primitive Pythagorean triangle.at n=13A024408
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=36A024862
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=42A027578
- Irreducible Euler sums of weight 8 and depth 10+2n.at n=12A031164
- Number of necklaces with 8 black beads and n-8 white beads.at n=13A032193
- a(n) = 2*binomial(n,4).at n=20A034827
- Schoenheim bound L_1(n,8,7).at n=12A036835
- Products of exactly 5 distinct primes.at n=22A046387
- T(n,n-2), array T given by A047000.at n=8A047004
- T(n,n+3), array T as in A047060.at n=8A047068
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+3)/3.at n=26A048090