7364
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 7420
- 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
- 3144
- Möbius Function
- 0
- Radical
- 3682
- Omega Function (Ω)
- 4
- 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
- 132
- 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
- Difference between two partition g.f.s.at n=12A007327
- Number of lines through exactly 6 points of an n X n grid of points.at n=47A018813
- Expansion of Product_{m>=1} 1/(1 + m*q^m)^8.at n=10A022700
- Otto Haxel's guess for magic numbers of nuclear shells.at n=28A033547
- Multiplicity of highest weight (or singular) vectors associated with character chi_15 of Monster module.at n=37A034403
- Number of partitions of n in which no parts are multiples of 5.at n=35A035959
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.at n=33A050792
- Solution to the Dancing School Problem with 6 girls and n+6 boys: f(6,n).at n=5A079911
- Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5).at n=5A079924
- E.g.f.: REVERT(2*x/(1+exp(x))) = Sum_{n>=0} a(n)*x^n/n!.at n=7A088789
- Number of triangles in an n X n grid of squares with diagonals.at n=13A100583
- Numbers k such that k and 8*k, taken together, are zeroless pandigital.at n=21A115932
- Sum of the even parts in all partitions of n into distinct parts.at n=33A116684
- If 0 <= n <= 3 then a(n) = n(n+1)(n+2)/3, if n >= 4 then a(n) = n(n^2+5)/3.at n=28A162626
- Numbers that are multiples of 28 and contain both a 4 and a 7.at n=18A171077
- Numbers m such that m and m+22 have the same sum of divisors.at n=29A172333
- Number of partitions of n into exactly 6 different parts with distinct multiplicities.at n=18A212117
- Number of nX2 0..3 arrays with no more than floor(nX2/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order.at n=4A222651
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order.at n=19A222654
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..3 order.at n=16A222654