9797
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9996
- Proper Divisor Sum (Aliquot Sum)
- 199
- 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
- 9600
- Möbius Function
- 1
- Radical
- 9797
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- From a differential equation.at n=14A000997
- a(n) = (6*n+1)*(6*n+5).at n=16A001513
- a(n) = (4*n+1)*(4*n+5).at n=24A003185
- Products of 2 successive primes.at n=24A006094
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=34A039664
- Number of partitions satisfying cn(2,5) <= 1 and cn(3,5) <= 1.at n=41A039855
- Numerators of continued fraction convergents to sqrt(986).at n=3A042908
- Sum of digits = 8 times number of digits.at n=39A061425
- a(1) = 4, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).at n=5A063380
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=15A064112
- Square root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).at n=3A074841
- a(n) = prime(2*n-1)*prime(2*n).at n=12A089581
- Numbers that are products of (at least two) consecutive primes.at n=35A097889
- Integer part of n#/(p-5)#, where p=preceding prime to n.at n=23A102791
- Integer part of n#/(p-7)#, where p=preceding prime to n.at n=22A102792
- Define a(1)=0, a(2)=0, a(3)=1, a(4)=3, a(5)=18, a(6)=22, a(7)=119, a(8)=285. Then a(n) = a(n-8) + 4*sqrt(420*a(n-4)^2 + 420*a(n-4) + 1).at n=10A103715
- Numbers k such that 2*prime(k)+1, 2*prime(k+1)+1 and 2*prime(k+2)-1 are also consecutive primes.at n=5A103851
- Numbers n such that 2*P(n)+1, 2*P(n+1)+1, and 2*P(n+2)-1 are also consecutive primes with P(n+1)=P(n)+6 and P(n+2)=P(n+1)+2 with P(i)=i-th prime.at n=4A103852
- a(n) = 8*n^2 - 3.at n=34A108928
- Fibonacci(p-J(p,5)) mod p^2, where p is the n-th prime and J is the Jacobi symbol.at n=25A113650