9708
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
- 12
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 12972
- 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
- 3232
- Möbius Function
- 0
- Radical
- 4854
- Omega Function (Ω)
- 4
- 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
- 122
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of tournaments on n nodes determined by their score vectors.at n=18A000570
- a(n) = n*(5*n^2 - 2)/3.at n=18A004466
- Sort then Add, a(1)=15.at n=14A033898
- Sort then Add, a(1)=21.at n=13A033901
- Number of asymmetric rooted trees with a forbidden limb of length 3.at n=17A052325
- Least k such that k*11^n +/- 1 are twin primes.at n=28A064220
- Interprimes which are of the form s*prime, s=12.at n=25A075287
- a(n) = Sum_{k=0..n} C(n,k) * C(4*n+k,k).at n=4A156887
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=11A157116
- Numbers n with property that n^2 is a sum of some 70 successive primes.at n=14A166256
- Partial sums of round(4^n/9).at n=8A178875
- Number of partitions of n such that the multiplicity of the greatest part is a part.at n=34A240494
- Partial sums of A243980.at n=19A244050
- Least m > 0 such that gcd(m^n+18, (m+1)^n+18) > 1, or 0 if there is no such m.at n=31A255868
- Numbers k such that 7*R_(k+2) - 6*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=18A257027
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 165", based on the 5-celled von Neumann neighborhood.at n=23A270459
- a(n) = Sum_{k=0..n} binomial(n,k)*binomial(n^2+k,k).at n=4A306280
- a(n) = Sum_{d|n} phi(d) * prime(d).at n=46A333558
- Triangular array read by rows: T(n,k) is the number of square n-permutations possessing exactly k cycles; n >= 0, 0 <= k <= n.at n=38A349645
- Number of free polyominoes of size 2n for which there exists at least one closed path that passes through each square exactly once.at n=8A361288