8300
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
- 18
- Divisor Sum
- 18228
- Proper Divisor Sum (Aliquot Sum)
- 9928
- 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
- 3280
- Möbius Function
- 0
- Radical
- 830
- Omega Function (Ω)
- 5
- 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
- 96
- 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 Hamiltonian paths in D_4 X P_n.at n=4A003760
- Coordination sequence for MgCu2, Cu position.at n=23A009930
- a(n) = a(n-1)+a(n-4).at n=27A014097
- Number of 1's in n-th term of A007651.at n=34A022466
- Multiplicity of highest weight (or singular) vectors associated with character chi_30 of Monster module.at n=36A034418
- Numbers m such that a^t + b^t + c^t + ... is prime, where a*b*c* ... is the prime factorization of m with multiplicity and t is the reversal of m.at n=8A108777
- Number of even parts in all partitions of n into distinct parts.at n=49A116680
- Number of base 8 n-digit numbers with adjacent digits differing by three or less.at n=5A126476
- Numbers k such that k and k^2 use only the digits 0, 3, 6, 8 and 9.at n=22A136945
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1111-1111 pattern in any orientation.at n=23A146938
- a(n) = Sum_{d|n} A007955(d) * A000027(n/d) = Sum_{d|n} A007955(d) * (n/d), where A007955(m) = product of divisors of m.at n=19A174932
- O.g.f. satisfies A(x/(1-x)) = 1/(1-x*A(x)-x^2*A(x)^2).at n=13A184936
- Number of 4-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=13A187299
- a(n) = n*(n+1) + (n+2)*(n+3) + (n+4)*(n+5) + (n+6)*(n+7).at n=42A217776
- Triangle T(n,k) represents the coefficients of (x^10*d/dx)^n, where n=1,2,3,...;generalization of Stirling numbers of second kind A008277, Lah-numbers A008297.at n=18A223512
- Product between n-th prime and next perfect square.at n=22A229497
- Number of length 4+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=10A248541
- a(n) = (9*n^2 - n)/2 + 1.at n=43A276819
- Array read by antidiagonals: T(m,n) = number of m-ary words of length n with adjacent elements differing by 3 or less.at n=49A285267
- Practical numbers k such that k^4 + 2 is also practical.at n=31A321308