9226
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 6614
- 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
- 3948
- Möbius Function
- -1
- Radical
- 9226
- 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
- 153
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=18A020429
- Fibonacci sequence beginning 4, 22.at n=14A022385
- Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=42A035544
- Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=21A035594
- Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.at n=27A052153
- a(n) = (9*n^2 + 5*n + 2)/2.at n=45A064225
- Expansion of (1-2x-x^2)/((1-2x)(1-4x+x^2)).at n=7A087945
- Numbers k such that A128162(k) is prime.at n=22A128163
- Number of n-element subsets of {1,2,...,2n-1} whose elements sum to a multiple of n.at n=9A145855
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=56A146773
- First differences of harmonic (or Ore) numbers A001599.at n=13A153789
- a(n) = 225*n + 1.at n=40A158229
- a(n) = 5*n^2 + 20*n + 1.at n=41A162316
- (1, 3, 5, 7, 9, ...) convolved with (1, 0, 3, 5, 7, 9, ...).at n=24A179903
- a(n) is the least k such that f(a(n-1)+1) + ... + f(k) > f(a(n-2)+1) + ... + f(a(n-1)) for n > 1, where f(n) = 1/(n+6) and a(1) = 1.at n=7A225921
- Number of unimodal compositions of n where the maximal part appears three times.at n=32A226541
- Number of nX3 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=7A230814
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=47A230819
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=52A230819
- Rectangular array T(n,m), read by upward antidiagonals: T(n,m) is the number of difunctional (regular) binary relations between an n-element set and an m-element set.at n=31A265417