17144
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 32160
- Proper Divisor Sum (Aliquot Sum)
- 15016
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8568
- Möbius Function
- 0
- Radical
- 4286
- Omega Function (Ω)
- 4
- 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
- 172
- 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
- Number of compositions of n such that two adjacent parts are not equal modulo 3.at n=21A062201
- Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four or five distinct values for every i,j,k<=n.at n=12A211526
- Number of n X 1 0..1 arrays with every row and column least squares fitting to a nonnegative slope straight line, with a single point array taken as having zero slope.at n=14A222855
- Number of partitions of n such that the number of even parts is a part.at n=40A240573
- Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=13A264544
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=3A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=8A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=13A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=18A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=23A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=28A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=33A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=38A271268
- Concatenate sum of digits of previous term and product of digits of previous term, starting with 8.at n=43A271268
- p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - 8*S^2.at n=7A291001
- Number of ways to choose a set partition of a strict integer partition of n.at n=31A294617
- Infinite square array, where row r >= 0 is the orbit of r under the map A380873: concatenate(sum of digits, product of digits).at n=74A380872