9864
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26910
- Proper Divisor Sum (Aliquot Sum)
- 17046
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3264
- Möbius Function
- 0
- Radical
- 822
- Omega Function (Ω)
- 6
- 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
- 135
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = Sum_t t*F(n,t), where F(n,t) (see A033185) is the number of rooted forests with n (unlabeled) nodes and exactly t rooted trees.at n=10A005197
- Triangle read by rows: T(n,k) is the coefficient of x^k of the polynomial n(n-x)(n-2x)(n-3x)...(n-(n-1)x) (n>=1, 0<=k<=n-1).at n=19A123670
- a(n) = floor(log_10(2^(2^n))).at n=14A129784
- 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, 1, 1), (0, 0, -1), (1, 0, -1), (1, 0, 0)}.at n=9A148395
- 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, 0), (-1, 0, 0), (0, -1, 1), (0, 0, 1), (1, 1, -1)}.at n=9A148459
- Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 3,0 4,0 polyhexes in any orientation on a planar nXnXn triangular grid.at n=5A155236
- Numbers divisible by at least four of their digits, different and >1.at n=26A187238
- Coefficient of x in the reduction of the n-th Fibonacci polynomial by x^3->x^2+3x+1.at n=11A192778
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero second and third differences.at n=11A200205
- Numbers a = b + c where a, b, and c contain the same decimal digits.at n=25A203024
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n+2.at n=35A210374
- Numbers k such that k and k^3 are sums of two twin primes.at n=10A213811
- Number of cyclotomic cosets of 13 mod 10^n.at n=35A221855
- Triangle read by rows: T(n,k) (n >= 1, k >= 0) = number of Dyck paths of semilength k avoiding the pattern U^n D^n.at n=46A238094
- E.g.f.: A(x,y) = exp(y)*P(x) - Q(x,y), where P(x) = 1/Product_{n>=1} (1 - x^n/n) and Q(x,y) = Sum_{n>=1} y^n / Product_{k=1..n} (k - x^k).at n=39A249480
- Number of nX7 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=1A269051
- T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=29A269052
- Number of 2 X n 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=6A269053
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 461", based on the 5-celled von Neumann neighborhood.at n=23A272293
- a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.at n=32A274328