9697
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9698
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9696
- Möbius Function
- -1
- Radical
- 9697
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 135
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1197
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of cos(sin(x)*cos(x)), even terms only.at n=4A009046
- Expansion of e.g.f. exp(sinh(x)*cosh(x)).at n=8A009229
- Primes that remain prime through 3 iterations of function f(x) = 4x + 3.at n=26A023281
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=29A024972
- Primes formed by concatenating n with n+1.at n=14A030458
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=17A031824
- Primes whose consecutive digits differ by 2 or 3.at n=46A048414
- Euclid-Mullin sequence (A000945) with initial value a(1)=89 instead of a(1)=2.at n=11A051328
- Primes whose decimal expansion is a concatenation of two or more consecutive increasing numbers (no leading zeros allowed).at n=15A052087
- Boris Stechkin's function.at n=28A055004
- Primes with 10 as smallest positive primitive root.at n=24A061323
- Primes p such that q-p = 22, where q is the next prime after p.at n=15A061779
- S[A002808(n)] where S[] is Boris Stechkin's function (A055004) and A002808(n) are the composites.at n=19A063483
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=42A065216
- a(n) = number of 3-times (but not 4-times) reformable permutation of {1,...,n}.at n=9A067950
- Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.at n=23A074789
- Final terms of rows of A077321.at n=31A077323
- Non-palindromic primes which on subtracting their reversal gives perfect cubes.at n=14A080178
- Primes whose 10's complement is a palindrome.at n=43A083017
- Primes of the form k^2 - 7*k + 7.at n=25A089376