8859
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
- 4
- Divisor Sum
- 11816
- Proper Divisor Sum (Aliquot Sum)
- 2957
- 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
- 5904
- Möbius Function
- 1
- Radical
- 8859
- 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
- 78
- 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
- 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 62.at n=32A031560
- Numbers whose set of base-9 digits is {1,3}.at n=41A032916
- Multiplicity of highest weight (or singular) vectors associated with character chi_5 of Monster module.at n=46A034393
- Numerators of continued fraction convergents to sqrt(781).at n=6A042506
- Numbers having three 3's in base 9.at n=36A043467
- Least k such that there are no middle divisors of k (A071090) through k+n.at n=14A071563
- Number of ways the set {1,2,...,n} can be split into three subsets of which the three sums are consecutive.at n=14A113039
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-1111-0100-0100 pattern in any orientation.at n=12A147468
- a(n) = A216958(n)/2.at n=15A216959
- Odd numbers k such that A098548(k) is not a multiple of 3.at n=32A251540
- Triangle, read by rows, T(n,k) = k*Sum_{i=0..n-k} C(2*i+2*k,i)*C(n-i-1,k-1)/(i+k) for 1 <= k <= n.at n=50A257488
- Numbers m, such that the smallest prime factor of 1+78557*2^m doesn't belong to the covering set {3, 5, 7, 13, 19, 37, 73}.at n=26A258095
- Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) * Product_{j=1..i} 1/(1 - mu(j)^2*x^j), where mu() is the Moebius function (A008683).at n=37A284835
- Numbers n such that 11^n is the highest power of 11 dividing A240751(n).at n=40A286006
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^8)).at n=27A288343
- Sum of the second largest parts in the partitions of n into 8 parts.at n=34A308997
- Indices of primes followed by a gap (distance to next larger prime) of 34.at n=30A320715
- Where the zeros in A123066 occur.at n=24A321962