17501
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20064
- Proper Divisor Sum (Aliquot Sum)
- 2563
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15120
- Möbius Function
- -1
- Radical
- 17501
- 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
- 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 = (primes).at n=21A025111
- Numbers n such that 217*2^n-1 is prime.at n=10A050860
- a(n) = A083962(n)/n.at n=11A083963
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).at n=42A088003
- Number of 4k+3 integers in range ]2^n,2^(n+1)] whose Jacobi-vector is a Motzkin-path (A095100).at n=17A095090
- Expansion of q^(-1/3) * eta(q^6)^2 / (eta(q) * eta(q^3)) in powers of q.at n=33A097197
- Zero followed by partial sums of A008865.at n=37A145067
- a(n) = 625*n + 1.at n=27A158383
- a(n) = 28*n^2 + 1.at n=25A158556
- Number of n X 3 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 4 binary array having a sum of three or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=9A227266
- Number of conjugacy classes in Weyl group of type D_n.at n=19A234254
- Number of partitions of n such that the number of odd parts is a part.at n=43A240574
- Number of partitions of n such that the number of parts having multiplicity 1 is not a part and the number of distinct parts is a part.at n=46A241443
- Integers k such that 19*(10^k) + 1 is prime.at n=23A267420
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 542", based on the 5-celled von Neumann neighborhood.at n=36A272811
- Numbers n such that 4^n + 3^(n+1) is prime.at n=30A274693
- G.f.: (Product_{j>=1} 1/(1-q^j)^2 + Product_{j>=1} 1/(1-q^(2*j)))/2.at n=21A281357
- Replacing each digit d in decimal expansion of n with d^2 yields a prime at each step when done recursively three times.at n=21A316604
- a(n) is the smallest start of a run of n or more integers having a prime factor greater than n.at n=38A327909
- a(n) is the smallest start of a run of n or more integers having a prime factor greater than n.at n=39A327909