17130
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 41184
- Proper Divisor Sum (Aliquot Sum)
- 24054
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4560
- Möbius Function
- 1
- Radical
- 17130
- 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
- 27
- 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
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...).at n=28A024479
- Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= sqrt(n).at n=41A048095
- a(n) is the smallest number k such that A073813(k) = prime(n).at n=33A073814
- a(n)=4a(n-1)+C(n+4,4),n>0, a(0)=1.at n=6A097789
- a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=33A120389
- Expansion of -1/((1 - x)*(1 - x^2 + 4*x^3)).at n=19A175714
- a(1)=2; for n > 1, a(n) is the largest number <= 2*a(n-1) divisible by n.at n=14A178901
- Maximal sum of x0 + x0*x1 + ... + x0*x1*...*xk over all compositions x0 + ... + xk = n.at n=25A239288
- Number of partitions p of n such that mean(p) > multiplicity(max(p)).at n=36A240202
- Sum of distinct products i*j*k with 1 <= i, j, k <= n.at n=8A323334
- a(n)^2 is the least square with exactly n 1's in base n.at n=5A342546
- The number of Hamiltonian cycles with rotational symmetry of order 3 on the triangular grid, n vertices on each side.at n=10A379747