17393
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17394
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17392
- Möbius Function
- -1
- Radical
- 17393
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 2001
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 59.at n=25A020398
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=2 and a(2)=a(3)=1.at n=14A024957
- Primes p such that the decimal digits of p^2 can be partitioned into two or more nonzero squares.at n=32A048646
- Primes of the form k(k+1)/2+2 (i.e., two more than a triangular number).at n=36A055472
- Fourth row of Pascal-(1,3,1) array A081578.at n=12A081586
- Primes arising in A086498: a(n) = (2n)-th partial sum of A086498.at n=42A086499
- a(n) is the smallest prime used as initial value for Euclid-Mullin (EM) sequence (of variant A000945), such that in the corresponding EM-sequence the p=3 prime arises at the n-th position.at n=8A093780
- Primes p such that p's set of distinct digits is {1,3,7,9}.at n=10A108386
- Primes congruent to 47 mod 59.at n=36A142774
- Primes congruent to 8 mod 61.at n=36A142806
- Emirps using each of the digits 1, 3, 7, 9 at least once, but no others.at n=4A158917
- Numbers k that divide the sum of digits of 13^k.at n=37A175525
- Emirps whose internal digits are also an emirp.at n=22A225235
- Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).at n=49A235117
- Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).at n=61A235117
- Consider two consecutive primes {p,q} such that P=2p+q and Q=2q+p are both prime. The sequence gives primes Q.at n=37A248483
- Number of polynomials a_k*x^k + ... + a_1*x + a_0 with k > 0, integer coefficients and only non-multiple positive integer roots and a_0 = p^n (p is a prime).at n=40A248956
- Primes of the form 2k^2 + k + 2.at n=16A249606
- Prime p1 of consecutive primes p1, p2, where p2 - p1 = 8, and p1, p2 are in different centuries.at n=13A287049
- Primes p not of the form k^2+s where k > 1 and 1 <= s < (k+1)^2, such that q = k^4+s is prime.at n=32A302485