17488
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 33914
- Proper Divisor Sum (Aliquot Sum)
- 16426
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8736
- Möbius Function
- 0
- Radical
- 2186
- Omega Function (Ω)
- 5
- 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
- 35
- 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
- yes
- Odd
- no
Appears in sequences
- exp(sinh(x)*arcsin(x))=1+2/2!*x^2+20/4!*x^4+440/6!*x^6+17488/8!*x^8...at n=4A012533
- Number of partitions of n into parts not of the form 21k, 21k+2 or 21k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 9 are greater than 1.at n=42A035980
- Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=15A045037
- Number of ordered tricoverings of an unlabeled n-set.at n=4A060491
- a(n) = A000695(A014486(n)).at n=10A083931
- Numbers n which when converted to base 3, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.at n=7A091077
- Numbers k such that 9*10^k + 7 is prime.at n=22A096774
- Number of strings of numbers x(i=1..6) in 0..n with sum i^2*x(i) equal to n*36.at n=13A183957
- Number of 6-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n.at n=12A208973
- Number of 2-divided words of length n over a 3-letter alphabet.at n=8A210323
- a(n) = sigma(2*n^3) - sigma(n^3).at n=17A225959
- Numbers k such that k^2 | A038199(k).at n=31A317475
- Array read by antidiagonals: A(n,k) is the number of binary matrices with k columns and any number of distinct nonzero rows with n ones in every column and columns in nonincreasing lexicographic order.at n=31A331571
- a(n) = Sum_{-n<i<n, -n<j<n, gcd{i,j}=1} (n-|i|)*(n-|j|).at n=12A331771
- Numbers k such that the ring of integers of Q(2^(1/k)) is not Z[2^(1/k)].at n=19A342390
- Number of integer partitions of n whose weighted sum is not divisible by n.at n=35A362560
- a(n) = (1/4) * Sum_{k=0..floor(n/3)} (n-2*k+2) * 2^(n-2*k) * binomial(2*n-4*k+2,2*k+1).at n=7A391834