17325
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 38688
- Proper Divisor Sum (Aliquot Sum)
- 21363
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 1155
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 128
- 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
- no
- Odd
- yes
Appears in sequences
- Exponential generating function: (1+3*x)/(1-2*x)^(7/2).at n=4A000457
- Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=31A001497
- Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=32A001498
- Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m).at n=36A005231
- Triangle T(n,k) of associated Stirling numbers of second kind, n >= 2, 1 <= k <= floor(n/2).at n=29A008299
- Triangle of numbers arising from analysis of Levine's sequence A011784.at n=27A014621
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3 + (n+4)^3.at n=13A027604
- Least number with exactly n odd divisors.at n=35A038547
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) and cn(0,5) <= cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(3,5).at n=37A039843
- a(1)=6; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i * Product p_{i+2}^e_i.at n=19A045969
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=42A049355
- A triangle of numbers related to triangle A030528; array a(n,m), read by rows (1 <= m <= n).at n=61A049403
- Highly composite odd numbers: odd numbers where d(n) increases to a record.at n=13A053624
- Coefficient triangle of certain polynomials N(5; m,x).at n=32A062190
- Numbers expressible as (a^2-1)(b^2-1) in at least 2 distinct ways (b>=a>1).at n=15A063067
- Coefficients of unitary Hermite polynomials He_n(x).at n=69A066325
- Triangle formed from coefficients of the polynomials p(1)=x, p(n+1) = (n + x*(n+1))*p(n) + x*x*(d/dx)p(n).at n=19A075856
- a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).at n=19A082637
- Triangle read by rows: T(n,k)=(1/2)*C(n+k,k)*C(n,n-k).at n=31A092370
- Numerators of even raw moments in the distribution of a triangle picked at random from points on the circumference of a unit circle.at n=4A093585