8604
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 13236
- 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
- 2856
- Möbius Function
- 0
- Radical
- 1434
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 109
- 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 MFS = ZSM-57 H1.5[Al1.5Si34.5O72] starting with a T3 atom.at n=12A019171
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=39A035555
- First differences of A037260.at n=30A037261
- a(n) = T(2n,n), array T as in A054144.at n=6A054147
- Triangle read by rows: T(n,k) is the coefficient of t^k (k >= 1) in the polynomial P[n,t] defined by P[1,t] = P[2,t] = t, P[n,t] = P[n-1,t] + P^2[n-2,t].at n=59A103484
- Starting with 1, each number is the previous number plus the product of the index number and the sum of the digits of the previous number.at n=31A113904
- a(n) = (5*n^3+12*n^2+n+6)/6.at n=21A114211
- Numbers that are not the sum of two triangular numbers and a fourth power.at n=41A115160
- Number of parts in all the compositions of n into Fibonacci numbers (i.e., in all ordered sequences of Fibonacci numbers having sum n; only one 1 is considered as a Fibonacci number).at n=11A121551
- Number of n X n binary arrays with all ones connected only in a 0110-0110-1111 pattern in any orientation.at n=7A147353
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 0110-0110-1111 pattern in any orientation.at n=16A147355
- a(n) = 4*n^2 + 3*n + 2.at n=46A185669
- E.g.f. A(x) satisfies: exp(A(x)) = 2*exp(A(x)^2) - (1-x), with A(0) = 0.at n=4A206403
- Smallest j such that j*2*p(n)^3-1=q is prime, j*2*p(n)*q^2-1=r, j*2*p(n)*r^2-1=s, where r and s are also prime.at n=12A224611
- Number of partitions p of n such that m(p) = m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=45A240728
- Expansion of Product_{k>=1} 1/(1 - k*(x^(2*k+1))).at n=37A266138
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 371", based on the 5-celled von Neumann neighborhood.at n=49A271454
- Number of parts in all partitions of n in which no part occurs more than nine times.at n=22A320612
- Triangle read by rows: T(n,k) = 2*n+1 for k = 0 and otherwise T(n,k) = Sum_{i=n-k..n, j=0..i-n+k, i<>n or j<>k} T(i,j).at n=34A335436
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 3 + 2*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=41A367300