9784
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18360
- Proper Divisor Sum (Aliquot Sum)
- 8576
- 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
- 4888
- Möbius Function
- 0
- Radical
- 2446
- 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
- 135
- 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
- Number of n-state Turing machines which halt.at n=1A004147
- Numbers k for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.at n=35A007811
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=40A020407
- Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=33A039871
- Numbers k such that 3*2^k + 5 is prime.at n=48A057913
- McKay-Thompson series of class 25A for Monster.at n=27A058594
- Interprimes which are of the form s*prime, s=8.at n=19A075283
- Maximal values in A038598.at n=48A093330
- Integer part of the area of consecutive prime sided isosceles triangles.at n=34A097442
- Triangle, read by rows, such that column n equals the row sums of A001263^n, which is the n-th matrix power of the Narayana triangle A001263, for n>=0.at n=39A105556
- Triangle read by rows, generated from A001263.at n=40A112338
- Triangle formed by coefficients of the expansion of p(x,n) = (1-x)^(2*n + 1)*Sum_{j >= 0} (1 +j +j^2)^n * x^j.at n=19A156985
- Triangle formed by coefficients of the expansion of p(x,n) = (1-x)^(2*n + 1)*Sum_{j >= 0} (1 +j +j^2)^n * x^j.at n=21A156985
- Coefficients of infinite sum polynomials; p(x,n)=If[Mod[n, 2] == 1, (1 - x)^(n + 1)*Sum[(k + 1)*(1 + k + k^2)^Floor[(n - 1)/2]* x^k, {k, 0, Infinity}], (1 - x)^(n + 1)*Sum[(1 + k + k^2)^Floor[n/2]*x^ k, {k, 0, Infinity}]].at n=35A169625
- Coefficients of infinite sum polynomials; p(x,n)=If[Mod[n, 2] == 1, (1 - x)^(n + 1)*Sum[(k + 1)*(1 + k + k^2)^Floor[(n - 1)/2]* x^k, {k, 0, Infinity}], (1 - x)^(n + 1)*Sum[(1 + k + k^2)^Floor[n/2]*x^ k, {k, 0, Infinity}]].at n=37A169625
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=10A175356
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=22A185718
- a(n) = A188491(n-1) + A188495(n-1) + A188497(n-1).at n=10A188493
- Number of two-sided n-step prudent walks ending at the northeast corner of their boxes, avoiding two consecutive west steps and south steps.at n=11A190794
- Number of two-sided n-step prudent walks ending at the northeast corner of their boxes, avoiding two consecutive west steps and south steps.at n=12A190794