8295
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 7065
- 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
- 3744
- Möbius Function
- 1
- Radical
- 8295
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Base-9 Armstrong or narcissistic numbers (written in base 10).at n=16A010353
- Weight distribution of [50,29,8] code associated with Hoffman-Singleton and Higman-Sims graphs.at n=20A015065
- Weight distribution of [50,29,8] code associated with Hoffman-Singleton and Higman-Sims graphs.at n=5A015065
- Pseudoprimes to base 41.at n=42A020169
- Pseudoprimes to base 71.at n=37A020199
- Number of paths in Moebius ladder M_n.at n=7A020874
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 13.at n=6A031691
- a(n) = (3*n+1)*(4*n+1).at n=26A033577
- Number of partitions of n into parts not of the form 23k, 23k+6 or 23k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=33A035994
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 9 skipped primes.at n=44A050776
- 21-gonal numbers: a(n) = n*(19n - 17)/2.at n=30A051873
- a(0) = 1, a(n) = smallest squarefree number == 1 (mod a(n-1)) with n prime divisors.at n=4A087526
- Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 51 for n > 0.at n=23A102014
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n}, having exactly k blocks consisting only odd entries (0<=k<=ceiling(n/2)).at n=30A124420
- Expansion of e.g.f. exp(x^2 / 2) / (1 - x).at n=7A130905
- Lexically least increasing sequence such that the sum of any nonempty subsequence is not a square.at n=11A133662
- a(n) = 169*n^2 + 2*n.at n=6A158220
- a(n) = ((2^b-1)/phi(n))*Sum_{d|n} Moebius(n/d)*d^(b-1) for b = 4.at n=22A160892
- Base 9 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-9 digits, for some k.at n=25A162234
- a(n) = n*(n+1)*(6*n-5)/2.at n=14A172082