2544
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 6696
- Proper Divisor Sum (Aliquot Sum)
- 4152
- 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
- 832
- Möbius Function
- 0
- Radical
- 318
- Omega Function (Ω)
- 6
- 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
- 58
- 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
- Number of compositions of n into 4 ordered relatively prime parts.at n=23A000742
- Number of 3 X (2n+1) zero-sum arrays with entries -n,...,0,...,n.at n=5A002047
- a(n) = n*(5*n - 1)/2.at n=32A005476
- 5th-order maximal independent sets in cycle graph.at n=44A007388
- Moebius transform of Fibonacci numbers.at n=17A007436
- Numbers k such that phi(k) + 5 | sigma(k).at n=6A015796
- Numbers k such that sigma(k) = sigma(k+6).at n=15A015866
- Coordination sequence T5 for Zeolite Code TER.at n=34A016437
- Convolution of A014306 (starting 0,0,1,1,0,1,1,1,1,...) and primes.at n=39A023674
- a(n) = Sum_{k=0..n} T(n,k), where T is the array defined in A025177.at n=8A025191
- a(n) = n*(n+5).at n=48A028557
- Expansion of (theta_3(z)*theta_3(23z)+theta_2(z)*theta_2(23z))^4.at n=17A028660
- Numbers with 20 divisors.at n=34A030638
- Numbers with exactly five distinct base-7 digits.at n=9A031984
- Denominators of continued fraction convergents to sqrt(395).at n=7A041751
- Numbers n such that string 3,6 occurs in the base 9 representation of n but not of n-1.at n=35A044284
- Numbers n such that string 4,4 occurs in the base 10 representation of n but not of n-1.at n=25A044376
- Numbers n such that string 3,6 occurs in the base 9 representation of n but not of n+1.at n=35A044665
- Numbers n such that string 4,4 occurs in the base 10 representation of n but not of n+1.at n=25A044757
- a(n) = Sum_{i=0..floor((n+1)/2)} T(2i+1,n-2i-1) where T is A049615.at n=40A049619