8095
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9720
- Proper Divisor Sum (Aliquot Sum)
- 1625
- 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
- 6472
- Möbius Function
- 1
- Radical
- 8095
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of permutations of (1,...,n) having n-2 inversions (n>=2).at n=8A001892
- Fibonacci sequence beginning 4, 19.at n=14A022135
- Number of partitions of n having exactly 1 part that appears exactly once.at n=41A116596
- Let M be the matrix defined in A111490. Sequence gives M(2,1)-M(1,2), M(2,1)+M(3,1)+M(3,2)-M(1,2)-M(1,3)-M(2,3), etc.at n=41A123329
- a(n) = 25*n^2 - 5.at n=17A158446
- Number of reduced words of length n in the Weyl group A_9.at n=8A161457
- Number of reduced words of length n in the Weyl group A_9.at n=37A161457
- Inverse of coefficient array of orthogonal polynomials P(n,x)=(x-2n)*P(n-1,x)-(2n-3)*P(n-2,x), P(0,x)=1,P(1,x)=x-2.at n=23A178121
- Row sums of triangle A178239.at n=29A178240
- Number of parts in all partitions of n in which no part occurs more than twice.at n=31A185350
- Number of free tree-like convex polyominoes with n cells.at n=13A204804
- Number of triangles, distinct up to congruence, on a centered hexagonal grid of size n.at n=9A241231
- Number of length n+2 0..n arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..n introduced in 0..n order.at n=10A243721
- Number of length n+2 0..6 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..6 introduced in 0..6 order.at n=10A243725
- Number of length n+2 0..7 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..7 introduced in 0..7 order.at n=10A243726
- Number of length n+2 0..8 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..8 introduced in 0..8 order.at n=10A243727
- Number of length n+2 0..9 arrays with no three unequal elements in a row and no three equal elements in a row and new values 0..9 introduced in 0..9 order.at n=10A243728
- Number of length 3+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=14A250420
- The difference between the number of partitions of 2n into odd parts (A000009) and the number of partitions of 2n into even parts (A035363).at n=32A282893
- Numbers k such that 3*10^k + 59 is prime.at n=19A290877