9264
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
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 24056
- Proper Divisor Sum (Aliquot Sum)
- 14792
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3072
- Möbius Function
- 0
- Radical
- 1158
- Omega Function (Ω)
- 6
- 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
- 34
- 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
- Denominators of convergents to cube root of 3.at n=10A002353
- Number of bipartite partitions.at n=16A002762
- a(0) = a(1) = 0; for n >= 2, a(n)*2^(n+2) + 1 is the smallest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.at n=15A007117
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(3,7).at n=10A019489
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(16,36).at n=8A022040
- Expansion of Product_{m>=1} (1 - m*q^m)^8.at n=15A022668
- a(n) = T(n, 2*n-5), T given by A027926.at n=15A027928
- Base 6 digital convolution sequence.at n=12A033643
- Nonnegative numbers of the form n^3 (+/-) 3, n >= 0.at n=41A052276
- a(n) = T(n,n-5), array T as in A055801.at n=32A055805
- McKay-Thompson series of class 41A for Monster.at n=47A058670
- Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.at n=31A067354
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2*(1-x^3)^2*(1-x^8)*(1-x^9)*(1-x^10)).at n=22A069956
- Sum of the quadratic residues of prime(n).at n=43A076409
- Expansion of (1-x)^(-1)/(1-2*x-x^3).at n=11A077852
- Number of unlabeled, connected graphs on n nodes which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite nor split and are primes.at n=10A079568
- a(n) = n^3 + 3.at n=21A084378
- n*phi(n)*phi(phi(n)) is a palindrome.at n=6A116022
- Sum of the quadratic nonresidues of prime(n).at n=43A125615
- a(n) = 4*n^2 + 73*n + 333.at n=38A157431