17898
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 37920
- Proper Divisor Sum (Aliquot Sum)
- 20022
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- 1
- Radical
- 17898
- Omega Function (Ω)
- 4
- 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
- 92
- 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
- Number of partitions of n such that if the smallest part is k, then both k and k+1 occur exactly once.at n=55A118267
- a(n) = Least i in range [A165598(n),A165598(n+1)] for which abs(A165597(i)) gets the maximum value in that range.at n=21A165599
- G.f.: Sum_{n>=1} x^n * (1+x)^n / (1-x^n).at n=20A227635
- a(n) is the number of base-4 n-digit numbers requiring only binary digits in bases 3 and 4.at n=50A230360
- a(n) = floor(log_10(1/error(n))), where error(n) is the error in the n-th iteration of the cubic Borwein-Borwein algorithm for computing 1/Pi.at n=7A276779
- a(n) = 282*2^n - 150.at n=6A305067
- a(n) = T(n, 4) with T(n, k) = Sum_{d|k} phi(d)*binomial(n - 1 + k/d, k/d).at n=24A327032
- Number of integer partitions of n whose product is greater than the product of their multiplicities.at n=36A353505
- Coefficients in the power series A(x) such that: 1 = Sum_{n=-oo..+oo} x^(3*n+2) * (1 - x^(n-1))^(n+1) * A(x)^n.at n=9A357160
- Number of edges in a Farey fan of order n.at n=44A360043