9717
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 3723
- 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
- 6240
- Möbius Function
- -1
- Radical
- 9717
- 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
- 47
- Smith Number
- yes
- 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
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=32A024588
- Numerators of continued fraction convergents to sqrt(356).at n=8A041674
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=30A046347
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=29A051401
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 83 ).at n=34A063356
- Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.at n=22A070756
- In base 3: smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=21A077403
- In base 3: n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.at n=7A077406
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=19A084048
- Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=15A089548
- {a(n)} is monotone increasing, with a(1)=1, a(2)=3 and, for n>2, a(n) is the smallest integer such that a(n) mod a(j) is never a(i) for any pair i,j with 1<=i<j<n.at n=46A100812
- Where records occur in A111390.at n=36A114111
- Starting numbers for which the RATS sequence has eventual period 14.at n=29A114615
- Triangle, read by rows, where column 0 is [1,-1,-2,-3,...,-n,...] and column k+1 is generated by the binomial transform of column k preceded by a zero (column k includes the k zeros above the main diagonal).at n=49A117334
- Composite numbers that are products of distinct primes and divisible by the sum of those primes.at n=30A131647
- 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, -1), (-1, 0, 1), (0, -1, 1), (0, 0, 1), (1, 1, -1)}.at n=9A148417
- Numbers k such that k^6 - 2 and k^6 + 2 are both primes.at n=17A154938
- Numbers k = p*q*r (p, q, r prime) congruent to 0 mod p+q+r.at n=21A160394
- The odd composites c such that c=q*g*j*y/2 and q+g=j*y where q,g,j,y are distinct primes.at n=23A167629
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,2,4,0,3 for x=0,1,2,3,4.at n=8A196596