4862
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 4210
- 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
- 1920
- Möbius Function
- 1
- Radical
- 4862
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- yes
- 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
- 165
- 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
- yes
- Odd
- no
Appears in sequences
- Symmetrical dissections of an n-gon.at n=16A000063
- a(n) = (n + 1)*(n + 2)*(n + 4)*(n + 8)*(n + 15)/120.at n=9A006636
- Table T(n,k), n>=0 and k>=0, read by antidiagonals: the k-th column given by the k-th Narayana polynomial.at n=56A008550
- Triangle read by rows: T(n,k) = number of closed meander systems of order n with k<=n components.at n=44A008828
- Catalan's triangle T(n,k) (read by rows): each term is the sum of the entries above and to the left, i.e., T(n,k) = Sum_{j=0..k} T(n-1,j).at n=53A009766
- Catalan's triangle T(n,k) (read by rows): each term is the sum of the entries above and to the left, i.e., T(n,k) = Sum_{j=0..k} T(n-1,j).at n=54A009766
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=18A010005
- a(n) = floor( binomial(n,8)/9).at n=18A011845
- a(n) = floor( binomial(n,9)/10 ).at n=18A011846
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=36A013592
- Catalan numbers with odd index: a(n) = binomial(4*n+2, 2*n+1)/(2*n+2).at n=4A024492
- a(n) = T(n, floor(n/2)), where T = Catalan triangle (A008315).at n=16A026008
- a(n) = floor( binomial(n, floor(n/2))/(1 + ceiling(n/2)) ) (interpolates between Catalan numbers).at n=18A028303
- a(n) = ceiling( binomial(n, floor(n/2))/(1 + ceiling(n/2)) ) (interpolates between Catalan numbers).at n=18A028304
- Triangle T(n,m) = Sum_{k=0..m} Catalan(n-k)*Catalan(k).at n=45A028364
- Triangle T(n,m) = Sum_{k=0..m} Catalan(n-k)*Catalan(k).at n=44A028364
- Triangle read by rows: T(n,m) = Sum Catalan(n-k)*Catalan(k), k=0..m.at n=54A028376
- Triangle read by rows: T(n,m) = Sum Catalan(n-k)*Catalan(k), k=0..m.at n=56A028376
- Concatenate rows of triangle in A028364 (removing duplicates).at n=37A028378
- Expansion of (1-2*x)/((1-x)^3*(1-4*x)).at n=6A028814