9208
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 8072
- 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
- 4600
- Möbius Function
- 0
- Radical
- 2302
- Omega Function (Ω)
- 4
- 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
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite TON = Theta-1 Nan[AlnSi24-nO48] starting with a T3 atom.at n=12A019245
- Row/column pre-periods of Sprague-Grundy values of Wythoff's Game.at n=39A046874
- a(n) = T(8,n), array T given by A048483.at n=10A048491
- a(n) = the least positive integer k such that Omega(n+k) = Omega(k)+n, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.at n=7A076158
- a(1)=1, a(n)=2*a(n-1)+1 if that number is not squarefree, a(n)=a(n-1)+1 otherwise.at n=53A081870
- G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).at n=47A083709
- Sum of first n 5-almost primes.at n=33A086047
- Poincaré series [or Poincare series] (or Molien series) for a certain six-fold wreath product P_6.at n=36A091769
- Number of permutations of floor(i*3/2), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147900
- Number of permutations of floor(i*3/2), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147908
- 144*n^2 - n.at n=7A156635
- a(n) = 576*n^2 - 2*n.at n=3A158371
- a(n) = 64*n^2 - 8.at n=11A158487
- Number of partitions of n into consecutive initial Fibonacci numbers.at n=46A172491
- Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1+4*x)/(1 - 2*x - 10*x^2 - 4*x^3).at n=6A179601
- Number of nX5 binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=5A183446
- Number of nX6 binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=4A183447
- T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=50A183450
- T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=49A183450
- a(n) = n + (n-1)*(2^n-2).at n=10A188716