9718
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15048
- Proper Divisor Sum (Aliquot Sum)
- 5330
- 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
- 4704
- Möbius Function
- -1
- Radical
- 9718
- 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
- 122
- 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 the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 98.at n=6A031596
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=30A051401
- Triangle read by rows: entries give numbers of permutations of [1..n] by absolute barycenter.at n=25A062867
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=24A063055
- a(n) = 3^n mod n^3.at n=28A066607
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=20A066696
- Number of base 28 circular n-digit numbers with adjacent digits differing by 2 or less.at n=5A124956
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=38A163562
- 1/16 the number of (n+1) X 7 0..3 arrays with all 2 X 2 subblocks having the same four values.at n=10A184036
- Row sums of A208657.at n=9A208658
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=15A214503
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.at n=28A214510
- G.f.: 1/((1-t^7)^2*(1-t)*(1-t^3)*(1-t^5)*(1-t^9)*(1-t^11)*(1-t^13)).at n=63A266747
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 587", based on the 5-celled von Neumann neighborhood.at n=21A273079
- Least inverse of A073454: Smallest m such that m divided by the primes up to m have exactly n repeated residues.at n=16A274320
- Numbers k such that phi(6k) is either phi(6k-2) or phi(6k+2), where phi is Euler's totient function A000010.at n=14A279011
- Numbers k such that phi(6k) = phi(6k+2), where phi is Euler's totient function A000010.at n=2A279184
- The number of trees with 4 nodes labeled by positive integers, where each tree's label sum is n.at n=42A301739
- Expansion of 1/2 * (((1 + 4*x)/(1 - 4*x))^(1/4) - 1).at n=9A305608
- a(n) is the smallest number k such that Sum_{j=1..k} (-1)^omega(j) = -n, where omega(j) is the number of distinct primes dividing j.at n=29A346456