17494
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 26244
- Proper Divisor Sum (Aliquot Sum)
- 8750
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8746
- Möbius Function
- 1
- Radical
- 17494
- 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
- 48
- 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
- yes
- Odd
- no
Appears in sequences
- Integer part of (Product(n^((1 + log(1 + i))/i^2), {i, 1, n})).at n=21A062486
- a(n) = sum of numbers without digit 1 and with product of digits = n-th 7-smooth number.at n=32A130975
- a(n) = 7*n^2 + 14*n + 1.at n=49A131878
- a(0)=1; thereafter a(n)=a(n-1)+a([n/Phi]), where Phi=(1+sqrt(5))/2, the golden ratio.at n=42A131882
- a(n) = 3*a(n-1)+4 for n > 0; a(0) = 6.at n=7A171495
- n-th prime is a circular prime (A016114).at n=17A173819
- Number of partitions of n containing a clique of size 6.at n=42A183563
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape P; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A247706
- a(n) = Sum_{k=1..n} phi(k)*phi(k+1)*phi(k+2), where phi(k) = A000010(k) is Euler's totient function.at n=22A335131
- Records in the trajectory of all positive integers in the 3x+1 or Collatz problem, including the trajectory [1, 4, 2, 1] of 1.at n=24A347652
- Number of integer partitions of 2n with exactly n distinct sums of nonempty submultisets.at n=37A365660
- a(n) = Sum_{k=0..n} binomial(n, k)^2 * (k - n)^k.at n=7A367273