5240
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 6640
- 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
- 2080
- Möbius Function
- 0
- Radical
- 1310
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 147
- 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
- Theta series of D_5 lattice.at n=25A005930
- Coordination sequence T8 for Zeolite Code MFI.at n=46A008171
- Convolution of A001950 with itself.at n=15A023667
- n written in fractional base 8/5.at n=32A024647
- a(n) = (d(n)-r(n))/2, where d = A026037 and r is the periodic sequence with fundamental period (1,0,0,1).at n=29A026038
- Number of binary rooted trees with n nodes and height exactly 9.at n=16A036598
- a(n)=(s(n)+2)/9, where s(n)=n-th base 9 palindrome that starts with 7.at n=35A043078
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=23A047881
- Number of colors that can be mixed with n >= 0 units of yellow, blue, red.at n=32A048241
- Composite numbers n such that sigma(n+24) = sigma(n) + 24.at n=12A054983
- Number of solutions to c(1)t(1) + ... + c(n)t(n) = 0, where c(i) = +-1 for i>1, c(1) = t(1) = 1, t(i) = triangular numbers (A000217).at n=22A058498
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 61 ).at n=34A063334
- Last digit of n, phi(n) and sigma(n) is 0 in base 10.at n=38A072604
- a(1)=1; a(n+1) is the smallest integer > a(n) such that Sum_{k=a(n)..a(n+1)} 1/sqrt(k) > Pi.at n=46A073347
- Self-convolution of A073739; odd-indexed terms are twice the odd primes.at n=46A073740
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=20A078184
- Antidiagonal sums of array A089975.at n=10A089976
- Coefficients in a certain Poincaré series [or Poincare series].at n=25A098705
- Expansion of 1/sqrt(1-4*x-8*x^2+32*x^3).at n=7A106184
- a(0)=a(1)=1; a(n) = lcm(a(n-1) + a(n-2), n).at n=8A128977