2514
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 2526
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 836
- Möbius Function
- -1
- Radical
- 2514
- Omega Function (Ω)
- 3
- 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
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Molien series for Weyl group E_7.at n=42A008583
- Expansion of (1+x^5)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=54A008766
- Coordination sequence for FeS2-Pyrite, Fe position.at n=23A009957
- Coordination sequence T2 for Zeolite Code OSI.at n=33A016431
- Define sequence S(a_0,a_1) by a_{n+2} is least integer such that a_{n+2}/a_{n+1}>a_{n+1}/a_n for n >= 0. This is S(3,4).at n=13A018908
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=2 and a(2)=a(3)=1.at n=12A024735
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=3 and a(2)=a(3)=1.at n=9A024737
- a(n) = T(n,1) + T(n-1,2) + ...+ T(n-k+1,k), where k = floor((n+1)/2) and T is the array defined in A026098.at n=23A026103
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 50.at n=1A031548
- G.f.: Product_{k>=1} (1 + 2*x^k).at n=25A032302
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 4 (mod 5).at n=43A035576
- Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1.at n=34A035989
- Numerators of continued fraction convergents to sqrt(44).at n=8A041074
- Numbers n such that string 2,2 occurs in the base 8 representation of n but not of n-1.at n=39A044205
- Numbers n such that string 0,3 occurs in the base 9 representation of n but not of n-1.at n=33A044254
- Numbers n such that string 1,4 occurs in the base 10 representation of n but not of n-1.at n=28A044346
- Numbers n such that string 2,2 occurs in the base 8 representation of n but not of n+1.at n=39A044586
- Numbers n such that string 0,3 occurs in the base 9 representation of n but not of n+1.at n=33A044635
- Numbers n such that string 1,4 occurs in the base 10 representation of n but not of n+1.at n=28A044727
- Numbers whose base-3 representation contains exactly four 0's and four 1's.at n=17A044989