9682
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 5294
- 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
- 4692
- Möbius Function
- -1
- Radical
- 9682
- 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
- 104
- 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
- Numbers k such that k!! - 1 is prime.at n=19A007749
- Coordination sequence for CaF2(1), F position.at n=33A009924
- Coordination sequence for CaF2(2), F position.at n=44A009925
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=44A010001
- a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=22A010010
- Numbers k such that 249*2^k+1 is prime.at n=42A032501
- a(n)-th prime is the smallest prime containing exactly n 1's.at n=5A037054
- Numbers having four 2's in base 8.at n=24A043432
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=13A049956
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=39A064026
- a(n) = n^3 - 2*n^2 + 2.at n=21A100109
- Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=10A129133
- Partial sums of A048995.at n=36A174514
- Numbers that are the product of 3 distinct primes a,b and c, such that a^2+b^2+c^2 is the average of a twin prime pair.at n=42A176879
- Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=15A192980
- Number of n X 1 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,1,0,4,2 for x=0,1,2,3,4.at n=15A196700
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=23A271166
- floor(r*a(n-1)) + floor(r*a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1.at n=13A275862
- Positions of 2's in A264977; positions of 3's in A277330.at n=39A277712
- a(n) = 4*n^2 + 18*n.at n=47A277979