9611
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10992
- Proper Divisor Sum (Aliquot Sum)
- 1381
- 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
- 8232
- Möbius Function
- 1
- Radical
- 9611
- 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
- 166
- 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
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 28.at n=6A031706
- Every run of digits of n in base 6 has length 2.at n=39A033004
- Numerators of continued fraction convergents to sqrt(103).at n=8A041184
- Numerators of continued fraction convergents to sqrt(509).at n=7A041972
- Main diagonal of table A083050.at n=15A083052
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=34A090495
- Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.at n=6A092291
- Numbers m such that (15m-4, 15m-2, 15m+2, 15m+4) is a prime quadruple.at n=43A112540
- Expansion of 1/(1-x-x^4-x^6).at n=26A120446
- Smallest m such that A132575(m) = n.at n=39A132576
- 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, 0, 0), (0, 0, 1), (1, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=7A150614
- a(n) = 10*n^2 + 1.at n=31A158187
- a(n) = 961*n + 1.at n=9A158414
- a(n) = 49*n^2 + 7.at n=13A158481
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 7 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=11A166057
- Number of 3 X 3 0..n symmetric arrays with all rows summing to floor(n*3/2).at n=26A213801
- a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=35A215525
- Number of length n+4 0..2 arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=4A247921
- T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=19A247927
- Number of length 5+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=1A247932