17701
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18304
- Proper Divisor Sum (Aliquot Sum)
- 603
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17100
- Möbius Function
- 1
- Radical
- 17701
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 48
- Smith Number
- no
- 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
- Expansion of e.g.f. arcsinh(sec(x) * log(x+1)).at n=9A012776
- Pseudoprimes to base 90.at n=29A020218
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.at n=38A024596
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=37A025110
- Becomes prime after n iterations of f(x) = phi(x)+1 (least inverse of A039651).at n=12A039652
- a(n) = Sum_{1 <= x, y <= n} lcm(x, y).at n=16A064951
- Indices of primes in sequence defined by A(0) = 27, A(n) = 10*A(n-1) - 13 for n > 0.at n=12A101962
- Numbers which are the sum of two positive cubes and divisible by 31.at n=30A102658
- Positions of zeros in A165597.at n=4A165598
- Number of (n+2)X3 0..2 arrays with each 3X3 subblock having sum 9.at n=1A187640
- Number of (n+2)X4 0..2 arrays with each 3X3 subblock having sum 9.at n=0A187641
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock having sum 9.at n=1A187645
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock having sum 9.at n=2A187645
- a(0)=0, a(n+1) is the least k>a(n) such that k+a(n)+n+1 is a Fibonacci number.at n=20A215006
- a(n) = (A216363(n) - 1)/118.at n=38A216380
- Semiprimes generated by the polynomial 2 * n^2 + 29.at n=21A241554
- 40-gonal numbers: a(n) = 38*n*(n-1)/2 + n.at n=31A261191
- Number of weakly unimodal compositions of n in which the greatest part occurs exactly five times.at n=45A320316
- Setwise difference A340150 \ A340076.at n=39A340151
- Composite numbers of the form 2*k^2 + 29.at n=21A352949