8841
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
- 13504
- Proper Divisor Sum (Aliquot Sum)
- 4663
- 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
- 5040
- Möbius Function
- -1
- Radical
- 8841
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 140
- 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
- a(n) = Sum_{k = 1..n} floor(2^k / k).at n=15A000801
- Expansion of e.g.f. theta_3^(-7/2).at n=4A015684
- Pseudoprimes to base 13.at n=24A020141
- Pseudoprimes to base 29.at n=44A020157
- 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=30A031560
- Numbers whose set of base-9 digits is {1,3}.at n=39A032916
- a(n)=T(n,n+1), array T as in A049735.at n=37A049741
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,2.at n=16A049858
- Geometric mean of the digits = 4. In other words, the product of the digits is = 4^k where k is the number of digits.at n=44A061428
- Numbers n such that Fibonacci(n) is not squarefree, but for all proper divisors k of n, Fibonacci(k) is squarefree.at n=26A065069
- q-factorial numbers 3!_q.at n=20A069778
- Numbers n such that Pi^(n*e)-e^n is closer to its nearest integer than any value of Pi^(k*e)-e^k for 1 <= k < n.at n=10A080280
- Triangle, read by rows, equal to the matrix inverse of A104416, where A104416(n,k) = A008275(k+1,n-k+1) (Stirling numbers of the first kind).at n=41A104417
- Numbers n such that googol - n is prime.at n=30A108251
- Numbers n such that p(7n) is prime, where p(n) is the number of partitions of n.at n=20A114167
- Triangle read by rows: row n gives coefficients C(n,j) for a Sheffer sequence (binomial-type) with raising operator -x { 1 + W[ -exp(-2) * (2+D) ] } where W is the Lambert W multi-valued function.at n=40A135338
- a(1)=1, a(n)=a(n-1)+n^1 if n odd, a(n)=a(n-1)+ n^5 if n is even.at n=5A140147
- a(n) = A145812(2n-1).at n=45A145849
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 4)*Sum[(2^m + 2*m )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=53A146955
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 4)*Sum[(2^m + 2*m )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=46A146955