9695
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13344
- Proper Divisor Sum (Aliquot Sum)
- 3649
- 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
- 6624
- Möbius Function
- -1
- Radical
- 9695
- 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
- 166
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n with at least 1 odd and 1 even part.at n=33A006477
- A thinks of x in set M; B asks questions: is x in T?; A may lie once but only when true answer is Yes; a(n) is maximal size of M such that B can determine x with <= n questions.at n=15A010033
- Number of partitions of n into parts 4k and 4k+2 with at least one part of each type.at n=66A035622
- Number of partitions of n with some part repeated.at n=33A047967
- T(n,n-4), where T is the array in A055830.at n=34A055831
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=15A065903
- Least k for the Theodorus spiral to complete n revolutions.at n=30A072895
- Sum of the digits of n^(n^n).at n=4A088735
- Numbers k such that k^6+6 is prime.at n=38A109836
- Where records occur in A111390.at n=25A114111
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=76A119455
- a(n) = n*(8*n - 3).at n=35A139273
- Binomial transform of [1, 4, 6, 4, 1, 1, -1, 1, -1, 1, ...].at n=18A140227
- Table T(n,k) read by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary Lyndon words (n,k >= 1) with length less than or equal to n.at n=60A143328
- Partial sums of A068148.at n=23A178137
- Numbers n such that 4n+3 is a palindromic prime.at n=35A193419
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=w+|y-z|.at n=31A212685
- Triangle read by rows: number of k-ary n-tuples (a_1,..,a_n) such that the string a_1...a_n is preprime.at n=20A215474
- Number of n-ary n-tuples (a_1,...,a_n) such that the string a_1...a_n is preprime.at n=5A215475
- Numbers k such that (41*10^k + 49)/9 is prime.at n=20A254441