9197
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9756
- Proper Divisor Sum (Aliquot Sum)
- 559
- 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
- 8640
- Möbius Function
- 1
- Radical
- 9197
- 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
- 153
- 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
- Pseudoprimes to base 52.at n=30A020180
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 9.at n=19A031422
- Numbers ending with '7' that are the difference of two positive cubes.at n=42A038862
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 7.at n=16A051972
- a(1) = 10, 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=6A063424
- a(n) = 242*n + 1.at n=37A157958
- a(n) = 484*n + 1.at n=18A158326
- a(n) = 76*n^2 + 1.at n=11A158767
- a(0) = 0 and a(n) = (4*n^3 - 12*n^2 + 20*n - 9)/3 for n >= 1.at n=20A174794
- y-values in the solution to 11*x^2-10 = y^2.at n=5A198949
- Number of (n+1) X 4 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=16A204646
- Shifts 5 places left under Euler transform with a(0)=0 and a(n)=1 for n<5.at n=26A218022
- Number of magic labelings with magic sum n of first graph shown in link.at n=9A244869
- Numbers k such that C(k+2,2) divides 2^(k+1) - 1.at n=15A246636
- Least positive integer k such that prime(k*n) - 1 = (prime(i*n)-1)*(prime(j*n)-1) for some integers 0 < i < j < k.at n=36A257938
- Number of asymmetric characteristic solutions to the n-queens problem.at n=12A260320
- Expansion of Product_{k>=1} 1/(1 - x^(2*k+3))^k.at n=49A263352
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 633", based on the 5-celled von Neumann neighborhood.at n=19A273301
- Integers k such that Euler(k, 1) is an integer multiple of Bernoulli(k + 1, 1).at n=31A342320