17219
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17544
- Proper Divisor Sum (Aliquot Sum)
- 325
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16896
- Möbius Function
- 1
- Radical
- 17219
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 172
- 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
- Numbers whose set of base-16 digits is {3,4}.at n=24A032840
- Special connected numbers: minimal and maximal connected numbers (cf. A029827) of a given binary order, i.e., between two consecutive powers of 2.at n=20A036379
- Floor(Zeta(3)^n).at n=52A125890
- Diagonal sums of triangle A096815.at n=28A212264
- Sum_{ i in 1..p-1, j in 1..p-1, i*j mod p = 1} i*j, where p = n-th prime.at n=12A272650
- Number of nX2 0..2 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..2 order.at n=6A274066
- T(n,k)=Number of nXk 0..2 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..2 order.at n=29A274068
- T(n,k)=Number of nXk 0..2 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..2 order.at n=34A274068
- Number of disconnected chordal simple graphs on n vertices.at n=9A287427
- G.f. A(x) satisfies: A(x) = (1/(1 - x)) * A(x^3)*A(x^5)*A(x^7)* ... *A(x^(2*k-1))* ...at n=55A308283
- Prime generating polynomial: a(n) = (4*n - 29)^2 + 58.at n=39A320772