8634
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
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 8646
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2876
- Möbius Function
- -1
- Radical
- 8634
- 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
- 52
- 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
- yes
- Odd
- no
Appears in sequences
- Number of words of length n in a certain language.at n=42A005819
- Powers of fourth root of 3 rounded down.at n=33A018051
- a(n) = prime(n)*prime(n-1) + 1.at n=24A023523
- Numbers having period-2 6-digitized sequences.at n=31A031357
- a(n) = smallest m >= 1 such that Sum_{k=1..m} log(k)/k >= n.at n=41A092753
- Triangle read by rows: T(n,k) (0 <= k <= ceiling(n/2)-1) is the number of (1,0) steps at level k in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology).at n=44A110237
- a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms -1,3,2,1.at n=20A111572
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=25A124140
- Sum of the heights of all left factors of Dyck paths of length n.at n=12A132891
- Numbers whose square is a permutational number A134640.at n=27A134742
- a(n) = (p(n)*p(n+2) - p(n+1))/2, where p(n) is the n-th odd prime.at n=29A152531
- Number of binary strings of length n with equal numbers of 00100 and 11011 substrings.at n=14A164243
- a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range.at n=42A165584
- Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s.at n=31A172528
- Number of arrays of 6 nondecreasing integers in -n..n with sum zero and equal numbers greater than zero and less than zero.at n=12A203293
- Denominators of Bernoulli numbers which are congruent to 3 (mod 9).at n=43A219543
- Bernoulli denominators with 8 divisors in increasing order (without repetitions).at n=38A219742
- Expansion of (2-x+x^2)/((1+x)*(1-3*x+x^2)).at n=9A248161
- a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4) + 2*a(n-5) - 2*a(n-7) for n>7 and where a(0)=2, a(1)=3, a(2)=6, a(3)=10, a(4)=17, a(5)=29, a(6)=51.at n=15A285665
- a(n) = 108*n^2 - 228*n + 114 (n>=2).at n=8A304618