3876
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
- 24
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 6204
- 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
- 1152
- Möbius Function
- 0
- Radical
- 1938
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- 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
- 51
- 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
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=19A000332
- Fermat coefficients.at n=6A000972
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation.at n=33A003451
- Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.at n=23A005427
- a(n) = binomial(3*n+1,n)/(n+1).at n=6A006013
- Number of intersections of diagonals in the interior of a regular n-gon.at n=18A006561
- If n mod 2 = 0 then n*(n^2-4)/12 else n*(n^2-1)/12.at n=36A006584
- Number of steps to compute n-th prime in PRIMEGAME (fast version).at n=5A007546
- Coordination sequence T4 for Zeolite Code AET.at n=43A008010
- Coordination sequence T1 for Zeolite Code AFT.at n=47A008026
- Coordination sequence T3 for Zeolite Code MEL.at n=40A008152
- Coordination sequence T2 for Zeolite Code AFX.at n=47A009865
- Binomial coefficient C(19,n).at n=15A010935
- Binomial coefficient C(19,n).at n=4A010935
- a(n) = binomial(n,15).at n=4A010968
- a(n) = floor(C(n,6)/7).at n=19A011797
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=20A011940
- Even pentagonal numbers.at n=25A014633
- Population of "Triangle" cellular automaton at n-th generation.at n=31A018189
- a(n) is the concatenation of n and 2n.at n=37A019550