8316
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 18564
- 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
- 2160
- Möbius Function
- 0
- Radical
- 462
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 52
- 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
- Weighted count of partitions with distinct parts.at n=33A005895
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=56A011902
- Number of inequivalent ways (mod D_4) a pair of checkers can be placed on an n X n board.at n=18A014409
- a(n) = n^3 + (n+1)^3 + (n+2)^3.at n=13A027602
- Expansion of 1/((1-x)^4*(1-x^2)^2).at n=17A028346
- Positive numbers k such that (k+1)*(k+2)*(k+3)*(k+4)/(k+(k+1)+(k+2)+(k+3)+(k+4)) is an integer.at n=19A032795
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 2,3,1.at n=5A037640
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=14A049934
- Numbers n such that 107*2^n-1 is prime.at n=18A050579
- Number of primitive (aperiodic) reversible strings with n beads using a maximum of four different colors.at n=6A056315
- Numbers k such that sigma(x) = k has exactly 8 solutions.at n=21A060664
- Number of triangular regions in regular n-gon with all diagonals drawn.at n=25A062361
- a(n) = n*(n-1)*(n-3)*(n-5).at n=12A062765
- Numbers k such that sigma(k) = 2*usigma(k).at n=23A063880
- Triangle of Gandhi polynomial coefficients.at n=23A065747
- Numbers n such that n*tau(n)>prime(4*n) where tau(n)=A000005(n).at n=39A068352
- Denominator of b(n), where b(n+1) = Sum_{k=0..n} b'((n^2-k^2)/n), b(0) = b(1) = 1, and b'(x) = b(x) if x is an integer and is linearly interpolated otherwise.at n=12A071301
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,6). The p-th row (p>=1) contains a(i,p) for i=1 to 6*p-5, where a(i,p) satisfies Sum_{i=1..n} C(i+5,6)^p = 7 * C(n+6,7) * Sum_{i=1..6*p-5} a(i,p) * C(n-1,i-1)/(i+6).at n=19A087110
- Numbers k divisible by at least one nontrivial permutation (rearrangement) of the digits of k, excluding all permutations that result in digit loss.at n=3A090056
- a(0)=1, a(n+1)=ceiling((1+1/n)^n*a(n)).at n=10A092247