4888
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 5192
- 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
- 2208
- Möbius Function
- 0
- Radical
- 1222
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 41
- 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 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=47A001305
- Number of partitions of n into nonprime parts.at n=52A002095
- Numbers that are the sum of 8 positive 7th powers.at n=21A003375
- Number of 4-dimensional polyominoes with n cells.at n=7A006767
- Sum of the first n primes.at n=49A007504
- Coordination sequence T5 for Zeolite Code MEL.at n=45A008154
- Multiplicity of K_3 in K_n.at n=51A014557
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=24A015850
- a(n) = Sum_{k=0..m} (k+1) * A026022(n, m-k), where m=n for n=0,1 and m = floor((n+3)/2) for n >= 2.at n=11A027299
- Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=16A031174
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=10A031781
- Numbers whose set of base-6 digits is {3,4}.at n=41A032830
- Multiplicity of highest weight (or singular) vectors associated with character chi_43 of Monster module.at n=35A034431
- Number of partitions satisfying (cn(0,5) <= cn(1,5) = cn(4,5)).at n=44A036809
- Denominators of continued fraction convergents to sqrt(806).at n=8A042555
- Numbers having three 8's in base 10.at n=4A043523
- Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (0 < d < n).at n=24A049429
- Triangle read by rows: T(n,d) is the number of distinct properly d-dimensional polyominoes (or polycubes) with n cells (n >= 1, d >= 0).at n=32A049430
- Composite numbers arising as sum of first k primes.at n=42A053790
- Number of ways to place non-intersecting diagonals in convex (n+2)-gon so as to create no quadrilaterals.at n=8A054515