8302
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14256
- Proper Divisor Sum (Aliquot Sum)
- 5954
- 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
- 3552
- Möbius Function
- -1
- Radical
- 8302
- 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
- 96
- 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 of 4-dimensional representation of u.g.g.r. #9.at n=13A013977
- Molien series of 4-dimensional representation of u.g.g.r. #8.at n=26A013978
- 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 90.at n=13A031588
- Multiplicity of highest weight (or singular) vectors associated with character chi_31 of Monster module.at n=36A034419
- Number of basis partitions of n+16 with Durfee square size 4.at n=42A053798
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 1), (1, 0, 0), (1, 1, 1)}.at n=7A150697
- Number of ways to place zero or more nonadjacent 2,0 3,1 3,2 4,2 4,3 4,4 5,2 6,2 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155447
- a(n) = 343*n - 273.at n=24A157369
- a(n) = 361*n - 1.at n=22A158308
- Triangle, T(n, k) = Sum_{j=0..k} (-1)^j*(n+k)!/((n-j)!*(k -j)!*j!) + Sum_{j=0..n-k} (-1)^j*(2*n-k)!/((n-j)!*(n-k-j)!*j!), read by rows.at n=23A176093
- Triangle, T(n, k) = Sum_{j=0..k} (-1)^j*(n+k)!/((n-j)!*(k -j)!*j!) + Sum_{j=0..n-k} (-1)^j*(2*n-k)!/((n-j)!*(n-k-j)!*j!), read by rows.at n=25A176093
- a(n)=2*a(n-1)+(n+3)*a(n-2)-(n+3)*a(n-3), a(0)=0, a(1)=0, a(2)=1.at n=9A187830
- Number of compositions (ordered partitions) of n into parts with an even number of distinct prime divisors.at n=33A286225
- a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 2 modulo 3.at n=44A335755
- Number of ways to write n as an ordered sum of 7 nonzero triangular numbers.at n=51A340952
- a(n) = pi(n) * Sum_{n <= q < 2n, q prime} q.at n=43A352754
- a(n) = Sum_{k=0..floor(n/2)} binomial(n+k-1,k) * binomial(n+3*k-1,n-2*k).at n=7A387617
- a(n) = Sum_{k=0..n} binomial(2*n+2*k+1,n-k).at n=6A390267