17110
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 15290
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6496
- Möbius Function
- 1
- Radical
- 17110
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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) = n*(n+1)*(2*n+1)/3.at n=29A006331
- Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=42A007000
- Numbers k such that sigma(k) and sigma(k+1) are nontrivial powers (A065496).at n=13A065522
- Numbers n such that phi(2n-1) = sigma(n).at n=37A067230
- Smallest number a(n)>a(n-1) such that T(a(n-1))+T(a(n))=T(m) for some m, a(1)=3; T(i) are the triangular numbers.at n=27A072522
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=21A089473
- a(n) is the least x such that A094892(x)=n.at n=4A095391
- a(n)=(a^n-b^n)/(a-b), where a=1.3802775690976141157... and b=-0.8191725133961644397... are the real roots of x^4-x^3-1=0.at n=31A097719
- a(n) = sum of n-th column in array in A100452.at n=26A100454
- 1/12 of product of three numbers: n-th prime, previous and following number.at n=15A127921
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=20A134263
- Numbers such that the digital sums in bases 3, 4, 5 and 6 all are equal.at n=24A135126
- Numbers such that the digital sums in bases 3, 4, 5, 6 and 7 all are equal.at n=12A135129
- a(n) = 2 * ceiling(n*((n^2)!^(1/n))).at n=3A165554
- Sum of the parts in the partitions of 4n into 4 parts with smallest part equal to 1 minus the number of these partitions.at n=14A239057
- Number of 2-separable partitions of n; see Comments.at n=52A239468
- Number of partitions of n such that the absolute value of the difference between the number of odd parts and the number of even parts is <=1.at n=45A239835
- a(n) = floor(6^n/(2+sqrt(5))^n).at n=28A240734
- Sum of the lengths of the arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.at n=38A264100
- G.f. A(x) satisfies: A(x) = 1 + x*A(x)^5 - x^2/A(x)^19.at n=6A295535