17156
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 30030
- Proper Divisor Sum (Aliquot Sum)
- 12874
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8576
- Möbius Function
- 0
- Radical
- 8578
- Omega Function (Ω)
- 3
- 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
- 79
- 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
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=43A034857
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) < cn(1,5).at n=63A036847
- Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.at n=37A110877
- Number of skew Dyck paths of semilength n ending with a left step.at n=9A128714
- 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, 1), (-1, 1, -1), (-1, 1, 1), (1, -1, -1), (1, 0, 0)}.at n=10A148266
- Generalized Riordan array based on the binomial transform of the Fine's numbers A000957.at n=47A187914
- Number of right triangles on a (n+1)X7 grid.at n=14A189811
- x-values in the solution to 17*x^2 - 16 = y^2.at n=7A199772
- Triangle read by rows: number of meanders filling out an n X k grid, unreduced for symmetry.at n=39A201145
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 5.at n=40A210377
- Number of (n+1)X(1+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18.at n=3A233990
- Number of (n+1)X(4+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18.at n=0A233993
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18.at n=6A233997
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18.at n=9A233997