17013
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
- 8
- Divisor Sum
- 23328
- Proper Divisor Sum (Aliquot Sum)
- 6315
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11024
- Möbius Function
- -1
- Radical
- 17013
- 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
- 79
- 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
- Revert transform of 2*x*(1 - x - x^3 + x^4)-x/(1+x).at n=8A049175
- Position of Fibonacci numbers in the EKG sequence.at n=21A140469
- The sum of the elements within a jump in a Sieve of Eratosthenes table.at n=27A179545
- Number of numbers which require n iterations of the unitary totient function (A047994) to reach 1.at n=18A225173
- Difference between 10^n and the first prime of gap 4 > 10^n.at n=43A227432
- G.f. satisfies: A(x) = x*exp( Sum_{n>=1} A(Lucas(n)*x^n) / n ).at n=10A229900
- Numbers n such that phi(n) = Sum_{j=1..k} d(n^j) for some k, where phi(n) is the Euler totient function of n and d(n) is the number of divisors of n.at n=37A283757
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^n/(1 - x^2*A(x)^n).at n=13A340333
- Numbers of the form prime(w)*prime(x)*prime(y) with w >= x >= y such that 2w = 3x + 4y.at n=28A358102