17004
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 43120
- Proper Divisor Sum (Aliquot Sum)
- 26116
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 8502
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 84
- 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
- Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=18A089548
- Expansion of -(3 - x + 2*x^2) / (1 - x^3 + x^4).at n=55A110063
- a(n) is the smallest number m such that sigma(m)=n*pi(m), or 0 if no such m exists.at n=20A137602
- a(n) = (p(n)*p(n+2) - p(n+1))/2, where p(n) is the n-th odd prime.at n=39A152531
- Number of length n+3 0..7 arrays with no four elements in a row with pattern aabb (possibly a=b) and new values 0..7 introduced in 0..7 order.at n=5A242548
- Number of nX3 0..1 arrays with every repeated value in every row and column greater than the previous repeated value.at n=11A267714
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 214", based on the 5-celled von Neumann neighborhood.at n=7A270906
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A316550
- a(n) = exp(-1) * n! * Sum_{k>=0} Laguerre(n,k) / k!.at n=8A356559
- Positions of records in A366091.at n=47A366065
- a(n) = Sum_{k=1..n} binomial(k+3,3) * floor(n/k).at n=21A366985
- Triangular array read by rows. T(n,k) is the number of binary relations on [n] that have exactly k accessible points, n>=0, 0<=k<=n.at n=13A370203
- Expansion of 1/( 1 - 9 * Sum_{k>=0} x^(2^k) / (1 - x^(2^k)) )^(1/3).at n=5A382366