8195
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 2605
- 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
- 5920
- Möbius Function
- -1
- Radical
- 8195
- 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
- 114
- 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
- Numbers that are the sum of 5 positive 6th powers.at n=36A003361
- Numbers that are the sum of 11 positive 10th powers.at n=8A004811
- Numbers that are the sum of 7 positive 11th powers.at n=4A004818
- Numbers that are the sum of at most 7 positive 11th powers.at n=29A004913
- Numbers that are the sum of at most 8 positive 11th powers.at n=33A004914
- Numbers that are the sum of at most 11 positive 11th powers.at n=45A004917
- Number of axially symmetric polyominoes with n cells.at n=16A006746
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFI = ZSM-5 Nan[AlnSi96-nO192] starting with a T11 atom.at n=12A019166
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=14A029580
- Number of balanced partitions of n: the largest part equals the number of parts.at n=48A047993
- a(n) = 2^n + 3.at n=13A062709
- Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.at n=16A071595
- a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.at n=14A085431
- a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.at n=9A088578
- Numbers n such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = (n+1)^2+(n+2)^2+...+b^2.at n=6A094552
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=22A098936
- Triangle read by rows giving coefficients in Bernoulli polynomials as defined in A001898, after multiplication by the common denominators A001898(n).at n=60A100655
- Index of the occurrence of n in A113698.at n=43A113699
- Expansion of x*(-1+5*x-6*x^2+x^3) / ( (2*x-1)*(x^3-3*x^2+1) ).at n=16A122167
- a(n) = n_{2^n}.at n=12A122624