9605
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12312
- Proper Divisor Sum (Aliquot Sum)
- 2707
- 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
- 7168
- Möbius Function
- -1
- Radical
- 9605
- 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
- Strong pseudoprimes to base 98.at n=14A020324
- a(n) = 3rd elementary symmetric function of first n+2 positive integers congruent to 1 mod 3.at n=3A024213
- dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=28A026063
- Euler transform of 4 3 2 1 1 1 1 1 1 1 ...at n=12A029860
- a(n) = (3*n+1)*(4*n+1).at n=28A033577
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 4).at n=55A046768
- Numbers n such that n^2 can be obtained from n by inserting internal (but not necessarily contiguous) digits.at n=44A046851
- a(n) = n*7^n + 1.at n=4A050919
- Numbers k such that k^6 == 1 (mod 7^4).at n=24A056092
- McKay-Thompson series of class 28a for Monster.at n=30A058610
- Pseudoquadprimes: p+4 for primes p where p+4 divides p^(p+4) + 4 and p+4 is composite.at n=8A100875
- Numbers k such that the concatenation of k with k-4 gives a square.at n=2A115432
- Numbers k such that k concatenated with k-8 gives the product of two numbers which differ by 4.at n=2A116104
- Numbers k such that k concatenated with k-5 gives the product of two numbers which differ by 2.at n=2A116121
- Number of dissimilar squarefree quaternary words of length n.at n=11A118311
- Composite number of the form 4n^2+1.at n=30A121944
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 6.at n=34A128676
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 9.at n=21A136914
- 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, 1, 0), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=8A149331
- Positive numbers y such that y^2 is of the form x^2+(x+119)^2 with integer x.at n=27A156650