9865
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11844
- Proper Divisor Sum (Aliquot Sum)
- 1979
- 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
- 7888
- Möbius Function
- 1
- Radical
- 9865
- 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
- 96
- 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
- 3rd power of rooted tree enumerator; number of linear forests of 3 rooted trees.at n=9A000242
- a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.at n=18A001215
- Numbers k such that the continued fraction for sqrt(k) has period 61.at n=6A020400
- Arrange digits of cubes in descending order.at n=19A032554
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x10^2 = n.at n=16A045852
- Number of digits in n-th Fermat number (A000215).at n=15A057755
- Interprimes which are of the form s*prime, s=5.at n=22A075280
- a(n) = n^4 - 15*n + 15.at n=9A107253
- Array T(n,k) read by antidiagonals: the k-th column contains the first column of the k-th power of A039755.at n=40A111670
- Coefficient triangle sequence of a polynomial recursion: p(x,n)=(x + 1)*(p(x, n - 1) + 3^(n - 1)*x); Row sums are 2*3^n.at n=46A153310
- Number of length n+5 0..4 arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=6A248485
- Number of length 7+5 0..n arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=3A248496
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - S - S^2 - S^3 - S^4 + S^5.at n=11A291248
- Right edge of triangle A297497.at n=12A297498
- Number of ways to fill a square matrix with the parts of a strict integer partition of n.at n=44A323522
- Number T(n,k) of proper k-times partitions of n; triangle T(n,k), n >= 0, 0 <= k <= max(0,n-1), read by rows.at n=41A327639
- Subword complexity of a the infinite word Prod_{i>=1} Prod_{j=1..i} a^j b^(i-j+1).at n=39A338761
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 5x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >=3, where u = p(2,x), v = 1 - x - x^2.at n=31A367210
- Consecutive states of the linear congruential pseudo-random number generator (25173*s+13849) mod 2^16 when started at s=1.at n=24A383940
- a(n) = Sum_{k=0..floor(n/3)} 2^(n-3*k) * binomial(k,n-3*k)^2.at n=24A387516