7301
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
- 6
- Divisor Sum
- 8550
- Proper Divisor Sum (Aliquot Sum)
- 1249
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6216
- Möbius Function
- 0
- Radical
- 1043
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- no
- Odd
- yes
Appears in sequences
- Number of solid partitions of n supported on graph of cube.at n=22A003404
- Number of ferrites M_8Y_n that repeat after 6n+40 layers.at n=16A011963
- Multiplicity of highest weight (or singular) vectors associated with character chi_51 of Monster module.at n=48A034439
- a(n) = Sum_{ d divides n } phi(d)*2^(n/d)/(2n).at n=15A053634
- Column 2 of triangle A055907.at n=23A055908
- a(n) = (9*n^2 + 5*n + 2)/2.at n=40A064225
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=10A093058
- (prime(n)*(prime(n+1)-1) + (prime(n)-1)*prime(n+1)) / 2.at n=21A099909
- a(n) = 3*A146085(n) - 1.at n=37A146087
- Triangle read by rows where T(n,k) is the number of factorizations of (n+1)! into k distinct factors.at n=39A157836
- a(n) = floor(1/{(n^4+3*n)^(1/4)}), where {}=fractional part.at n=73A184637
- a(n) = 12*n^2 - 8*n + 1.at n=25A185212
- a(n) = count of monomials, of degrees k=1 to n, in the elementary symmetric polynomials e(mu,k) summed over all partitions mu of n.at n=4A209670
- The number of n-digit numbers whose last k digits are divisible by k for k = 1..n.at n=6A221532
- Total number of parts of multiplicity 6 in all partitions of n.at n=37A222706
- Number of ordered triples (i,j,k) with |i|, |j|, |k|, |i*j*k| <= n.at n=22A226359
- Number of digits in the decimal expansion of the number of partitions of 3^n.at n=16A248729
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 619", based on the 5-celled von Neumann neighborhood.at n=45A273250
- Irregular triangle read by rows: T(n, k) = number of non-equivalent ways to tile an n X n X n triangular area with k 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-4*k) of 1 X 1 X 1 tiles.at n=40A286443
- Number of non-equivalent ways to tile an n X n X n triangular area with four 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-16) of 1 X 1 X 1 tiles.at n=5A286446