7280
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 13552
- 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
- 2304
- Möbius Function
- 0
- Radical
- 910
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 44
- 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 n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged.at n=18A000048
- 4-dimensional figurate numbers: a(n) = (5*n-1)*binomial(n+2,3)/4.at n=13A002418
- Orders of non-cyclic simple groups (divided by 4).at n=21A008976
- Number of partitions of n into an even number of parts, the least being 3; also, a(n+3) = number of partitions of n into an odd number of parts, each >=3.at n=56A027195
- a(n) = n*(n + 1)*(3*n + 1).at n=13A027903
- Expansion of 1/((1-4x)(1-6x)(1-8x)(1-10x)).at n=3A028136
- Every run of digits of n in base 15 has length 2.at n=32A033013
- a(n) = n*(n+1)*(n+2)*(n+3)/6.at n=13A033488
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=35A033579
- Positive integers with more base-15 runs of even length than odd.at n=34A044841
- a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).at n=32A048619
- a(n) = least common multiple of {1, 4, 7, 10, 13 ..., 3n+1} (A016777).at n=5A051536
- a(n) = ((6*n+8)(!^6))/8(!^6), related to A034689 (((6*n+2)(!^6))/2 sextic, or 6-factorials).at n=3A053101
- Number of monic irreducible polynomials over GF(4) of degree n with fixed nonzero trace.at n=8A054660
- Number of monic irreducible polynomials over GF(4) with zero trace.at n=8A054661
- Number of 4-ary Lyndon words of length n with trace 0 mod 4.at n=8A054664
- Exponential transform of Stirling2 triangle A008277.at n=25A055896
- Number of primitive (period n) n-bead necklace structures using exactly two different colored beads.at n=17A056303
- Irregular table a(n,k) = number of connected labeled chordal graphs on n nodes with k edges, containing no induced path P_4, for n >= 1, 1 <= k <= n*(n-1)/2, read by rows; also the number of labeled trees with each vertex replaced by a clique.at n=65A058865
- Numbers k such that phi(x) = k has exactly 11 solutions.at n=24A060674