17384
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
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 34020
- Proper Divisor Sum (Aliquot Sum)
- 16636
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8320
- Möbius Function
- 0
- Radical
- 4346
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 141
- 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
- Sin(n) decreases monotonically to -1.at n=29A046964
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=36A050788
- Records in A065925.at n=23A065927
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=28A079037
- Row sums of the triangle A105160.at n=14A105157
- Number of geometrically distinct closed knight's tours of a 3 X n chessboard that have twofold symmetry.at n=24A169768
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/cos(n) > a(k)/cos(a(k)), so that a(1)/cos(a(1)) > a(2)/cos(a(2)) > ... > a(k)/cos(a(k)) > ...at n=39A172446
- a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=28A172448
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood.at n=30A271307
- a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + 2*a(n-4) + a(n-5) -2*a(n-6) + a(n-7) for n >= 7, a(0) = 2, a(1) = 4, a(2) = 7, a(3) = 11, a(4) = 18, a(5) = 30, a(6) = 47.at n=20A289077
- Records in A171898.at n=19A309813
- Numbers k such that phi(k) < phi(k+1) < phi(k+2) < phi(k+3) where phi is the Euler totient function (A000010).at n=38A327880
- Sum of all squarefree semiprimes with greater prime factor prime(n).at n=15A339194
- Numbers k >= 1 such that A018804(k) divided by A000203(k) is an integer.at n=17A349726
- Number of Catalan words of length n avoiding the pattern 0000.at n=11A356697
- First n-bit number to appear in Van Eck's sequence (A181391).at n=14A358258
- Expansion of Sum_{0<i<j<k<l} q^(2*(i+j+k+l)-4)/( (1-q^(2*i-1))*(1-q^(2*j-1))*(1-q^(2*k-1))*(1-q^(2*l-1)) )^2.at n=27A365666
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=41A377037
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=43A377037
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=45A377037