9845
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 3115
- 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
- 7120
- Möbius Function
- -1
- Radical
- 9845
- 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
- 73
- 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
- Plaindromes: numbers whose digits in base 3 are in nondecreasing order.at n=47A023745
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 5).at n=58A035573
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=40A053020
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).at n=44A059820
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=31A076531
- Each term is previous term plus floor of harmonic mean of two previous terms.at n=17A114831
- a(n) = 6*a(n-1) - 9*a(n-2) + n + 1.at n=9A121365
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A149022
- Products of 3 distinct safe primes.at n=26A157354
- Partial sums of A160414.at n=21A161325
- Third left hand column of triangle A163940.at n=15A163943
- Number of (n+2) X 3 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=28A184540
- Triangle, read by rows, based on the Fibonacci numbers.at n=60A234713
- Number of parts in all partitions of n into odd number of distinct parts.at n=50A238131
- Number of weak peaks in all peakless Motzkin paths of length n.at n=12A247289
- Array read by antidiagonals: column k lists the 2-Stöhr sequence composed of terms rejected from column k-1.at n=45A271589
- Positive integers that have exactly eight representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=35A317398
- Array read by antidiagonals: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves of k colors.at n=72A339779
- Setwise difference A340150 \ A340076.at n=21A340151
- a(n) is the least k such that A322523(k) = n.at n=9A354538