8589
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13120
- Proper Divisor Sum (Aliquot Sum)
- 4531
- 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
- 4896
- Möbius Function
- -1
- Radical
- 8589
- 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
- 26
- 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
- no
- Odd
- yes
Appears in sequences
- cosh(log(x+1)-sin(x))= 1+3/4!*x^4-30/5!*x^5+180/6!*x^6-1113/7!*x^7...at n=8A013219
- Expansion of Product_{m>=1} 1/(1 + m*q^m)^6.at n=12A022698
- Convolution of natural numbers with composite numbers.at n=29A023539
- Lucky numbers that are concatenations of n with n + 4.at n=9A032654
- a(1) = 8; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=42A046258
- Interprimes (A024675) which are of the form s*prime, s=21.at n=23A075296
- Union of A080105 and A080106.at n=36A080078
- a(n) = round(113*phi^n).at n=21A080105
- Triangle T, read by rows, where T(n,k) = Sum_{j=1..n-k-1} [T^j](n-1,k) with T(n+1,n) = n+1 and T(n,n)=0 for n>=0, where T^n denotes the n-th matrix power of T.at n=38A132623
- Values of the genus g for which there exists a compact Riemann surface of genus g admitting an automorphism group of order 84(g-1), the maximum possible, also known as the Hurwitz bound.at n=29A179982
- a(n) = 6*n^2 + 10*n + 5.at n=37A201279
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=11A208181
- Triangle T(n,k), read by rows, giving the numerator of the coefficient of x^k in the Boros-Moll polynomial P_n(x) for n >= 0 and 0 <= k <=n.at n=16A223549
- Number of rooted identity trees with n nodes and exactly 5 subtrees from the root.at n=8A227809
- Number of (undirected) paths in the ladder graph P_2 X P_n.at n=8A288516
- G.f.: A(x,y) = (1-y)^2 * Sum_{n>=0} (2*n+1) * y^n * (1 + x*(1-y)^2 )^(n*(n+1)/2).at n=35A303650
- G.f.: A(x,y) = (1-y)^2 * Sum_{n>=0} (2*n+1) * y^n * (1 + x*(1-y)^2 )^(n*(n+1)/2).at n=36A303650
- Main diagonal of irregular triangle A303650.at n=5A303651
- Number of compositions of n with strictly increasing run-lengths.at n=40A333192
- a(1) = 1; if a(n) is not divisible by 3, a(n+1) = 4*a(n) + 1, otherwise a(n+1) = a(n)/3.at n=26A346035