9710
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17496
- Proper Divisor Sum (Aliquot Sum)
- 7786
- 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
- 3880
- Möbius Function
- -1
- Radical
- 9710
- 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
- Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence.at n=14A001970
- Numbers k such that 33*2^k - 1 is prime.at n=34A002240
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 4 (mod 5).at n=54A035586
- Numerators of continued fraction convergents to sqrt(685).at n=5A042316
- Number of 3-asymmetric rhythm cycles: binary necklaces of length 3n subject to the restriction that for any k if the k-th bead is of color 1 then the (k+n)-th and (k+2n)-th beads (modulo 3n) are of color 0.at n=8A115115
- a(n) = 7 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=25A120153
- Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n - n-th digit of sqrt(2)]. If k<0 or k=0, then a(k)=0.at n=32A133393
- List of primes with digits grouped into clumps of four. Leading zeros are not printed.at n=11A136420
- Determinant of power series of gamma matrix with determinant 2!.at n=4A158040
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=36A163562
- a(n) = 2*binomial(n+4, 4) + n + 4.at n=16A177206
- a(n) is the total number of k-reverses of n.at n=18A180249
- Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.at n=33A183898
- Number of strings of numbers x(i=1..n) in 0..5 with sum i^2*x(i)^2 equal to n^2*25.at n=9A184236
- Ceiling((7*n+1/n)^n).at n=2A197767
- Minimum value unattainable as the sum of 2 attained values of a*b+a*c+b*c with a,b,c 0..n integers.at n=42A225272
- Number of (n+1)X(2+1) 0..2 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=1A235738
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=4A235742
- Expansion of (1-sqrt(1-(2*(1-sqrt(1-4*x^2)))/x))/2.at n=10A242566
- Number of length n+4 0..5 arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=9A248984