9285
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 5595
- 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
- 4944
- Möbius Function
- -1
- Radical
- 9285
- 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
- 34
- Smith Number
- yes
- 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
- Number of restricted hexagonal polyominoes with n cells.at n=8A002212
- Number of polyhexes with n hexagons, having reflectional symmetry (see Harary and Read for precise definition).at n=15A002215
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-2)*a(2) for n >= 3.at n=8A025238
- Number of score sequences in tournament with n players, when 9 points are awarded in each game.at n=4A047736
- Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.at n=35A055450
- Triangle of numbers arising in recursive computation of A002212.at n=36A073149
- Expansion of x^4*(2+x)/((1+x)*(1-x)^5).at n=17A082289
- Expansion of (1+x+x^2)/((1+x^2)*(1+x)^4*(1-x)^5).at n=35A082290
- Triangular array related to Motzkin triangle A026300.at n=35A084536
- Number of primitive partition identities with largest part n.at n=10A089040
- Triangle read by rows: T(n,k) = number of lattice paths from (0,0) to (n,k) that do not go below the line y=0 and consist of steps U=(1,1), D=(1,-1) and three types of steps H=(1,0) (left factors of 3-Motzkin steps).at n=28A091965
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at odd height.at n=36A101894
- Sum array of Catalan numbers (A000108) read by upward antidiagonals.at n=37A106534
- Numbers m such that pi(m) = d_1^1 + d_2^2 + ... + d_k^k where d_1 d_2 ... d_k is the decimal expansion of m.at n=7A112719
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=28A120215
- a(n) = Sum_{k=0..n} k^n * k! * Stirling2(n,k).at n=4A122399
- Triangle read by rows: T(n,k) is number of hex trees with n edges and level of first leaf (in the preorder traversal) equal to k (1 <= k <= n).at n=36A126186
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having height of the first peak equal to k (1 <= k <= n).at n=36A128744
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having height of the first peak equal to k (1 <= k <= n).at n=37A128744
- Table with g.f. [1-x*n-sqrt(x^2*n^2-2*n*x+1+4*x^2-4*x)]/(2*x).at n=53A128888