9327
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12440
- Proper Divisor Sum (Aliquot Sum)
- 3113
- 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
- 6216
- Möbius Function
- 1
- Radical
- 9327
- 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
- 91
- 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
- a(n) = a(n-1) + a(n-2) + a(n-3), a(0)=3, a(1)=1, a(2)=3.at n=15A001644
- Representation degeneracies for boson strings.at n=28A005294
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=35A017834
- Self-convolution of (1, p(1), p(2), ...).at n=20A023626
- Number of partitions of n that do not contain 3 as a part.at n=37A027337
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 64.at n=23A031562
- Number of factorizations into distinct factors with 2 levels of parentheses indexed by prime signatures. A050347(A025487).at n=49A050348
- Numbers k such that 2^k + 9 is prime.at n=40A057196
- Numbers k such that 3*2^k + 35 is prime.at n=46A059759
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=23A063058
- Numbers k such that the digits of k joined to the digits of 2k contain each of the digits from 1 to 9 once.at n=11A064160
- a(n) = S(3n), where S(n) is the generalized tribonacci sequence A001644.at n=5A074582
- a(n) = ((1+(-1)^n)*T(n+1) + (1-(-1)^n)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644.at n=15A075536
- Powers of 3-Step Lucas numbers (A001644).at n=29A105949
- Shadow of Pi.at n=42A110621
- Expansion of g.f.: x/((1-x^2)^4 -1+x).at n=7A123889
- Triangle T(n,k) read by rows: number of k X k triangular (0,1)-matrices with exactly n entries equal to 1 and no zero rows or columns.at n=63A137252
- Triangle of 2-Eulerian numbers.at n=30A144696
- a(n) = largest number k such that k and k * n taken together have distinct digits, or 0 if no such k exists.at n=19A173780
- Numbers that have 9 terms in their Zeckendorf representation.at n=14A179249