4368
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 13888
- Proper Divisor Sum (Aliquot Sum)
- 9520
- 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
- 546
- Omega Function (Ω)
- 7
- 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
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 33
- 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
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=30A000338
- Binomial coefficients C(n,5).at n=16A000389
- Number of numbers == 0 (mod 3) in range 2^n to 2^(n+1) with odd number of 1's in binary expansion.at n=14A000773
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=21A001209
- a(n) = binomial(n,11).at n=5A001288
- Number of partitions of 3n-1 into n nonnegative integers each no more than 6.at n=19A001978
- 4-dimensional figurate numbers: a(n) = n*binomial(n+2, 3).at n=11A002417
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=22A002624
- Binomial coefficients C(2n,n-3).at n=5A002696
- Number of multigraphs with 4 nodes and n edges.at n=23A003082
- Expansion of bracket function.at n=10A006090
- G.f.: Product_{k>=1} (1 + x^(2*k - 1)) / (1 - x^(2*k)).at n=39A006950
- Sum of divisors of superabundant numbers (A004394).at n=15A007626
- Coordination sequence T2 for Zeolite Code EUO.at n=41A008097
- Number of Costas arrays of order n, counting rotations and flips as distinct.at n=10A008404
- Expansion of (1-x^12) / (1-x)^12.at n=5A008494
- 10-dimensional centered tetrahedral numbers.at n=5A008504
- Molien series for Conway group Con.0.at n=35A008925
- Expansion of exp(tanh(sinh(x))).at n=9A009259
- Expansion of sin(tan(sin(x))).at n=4A009500