17498
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28308
- Proper Divisor Sum (Aliquot Sum)
- 10810
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8064
- Möbius Function
- -1
- Radical
- 17498
- 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
- yes
- Odd
- no
Appears in sequences
- a(0) = 1, a(n) = 24*n^2 + 2 for n>0.at n=27A010014
- The 5x + 1 sequence beginning at 7.at n=32A028389
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 14 (most significant digit on right).at n=19A029507
- First gap of n in sequence A038593 (lower terms).at n=13A038661
- Numerators of continued fraction convergents to sqrt(672).at n=5A042292
- Row 3 of A007754.at n=24A058794
- Unidirectional 'Delannoy' variation of the Boustrophedon transform applied to all 1's sequence: construct an array in which the first element of each row is 1 and subsequent entries are given by T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k) + T(n-2,k-1). The last number in row n gives a(n).at n=7A064641
- Triangle defined in A064641 read by rows.at n=35A064642
- Convolution of sequence of primes with sequence sigma(n).at n=26A086718
- a(n) = 26*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 26.at n=3A090247
- Indices of primes in sequence defined by A(0) = 63, A(n) = 10*A(n-1) + 13 for n > 0.at n=21A101528
- a(n) = n^3 - 3*n.at n=26A121670
- a(n) = 625*n^2 - 886*n + 314.at n=5A157618
- Trajectory of 7 under repeated application of the map in A185452.at n=19A185455
- Triangle read by rows: let T(n,k) (for n >= 0, 0 <= k <= n) be the number of walks from (0,0) to (n,k) using steps (1,1), (1,0), (1,-1) and (0,-1); n-th row of triangle gives T(n,n), T(n,n-1), ..., T(n,0).at n=35A223092
- 5x + 1 sequence beginning at 11.at n=36A259193
- G.f.: 1/((1-t^10)*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^11)*(1-t^13)*(1-t^15)*(1-t^17)*(1-t^19)).at n=65A266750
- a(n) = floor((2*n+2)^n/(n+1)!) - binomial(2*n,n).at n=8A282709
- Union_{odd primes p, n >= 3} {T_p(n)}, where T_m(x) = x*T_{m-1}(x) - T_{m-2}(x), m >= 2, T_0(x) = 2, T_1(x) = x (dilated Chebyshev polynomials of the first kind).at n=26A299071
- Numbers k such that the equation x^2 - k*y^4 = -1 has a solution for which |y| > 2.at n=14A356488