17111
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17424
- Proper Divisor Sum (Aliquot Sum)
- 313
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16800
- Möbius Function
- 1
- Radical
- 17111
- 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
- 53
- 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
- no
- Odd
- yes
Appears in sequences
- Number of graphical basis partitions of 2n.at n=30A001130
- Numbers with multiplicative digital root value 7.at n=13A034054
- Numbers n such that sum of digits and product of digits are both prime.at n=23A052430
- Number of subsets of A = {1,2,...,n} that have the same center of gravity as A, i.e., (n+1)/2.at n=18A070925
- Near-repunit semiprimes.at n=31A105993
- Odd numbers n for which 19 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=8A112078
- Numbers such that the digital sums in bases 3, 4, 5 and 6 all are equal.at n=25A135126
- Numbers such that the digital sums in bases 3, 4, 5, 6 and 7 all are equal.at n=13A135129
- a(n) = (2*n^3 + 3*n^2 + n + 3)/3.at n=29A188475
- Least odd number k such that x' = k has n solutions, where x' is the arithmetic derivative (A003415) of x.at n=31A189560
- Composite numbers whose multiplicative digital root is 7.at n=6A201021
- Composite numbers for which both sum and product of digits are primes.at n=9A225864
- Numbers which can be decomposed as p*q + q*r + r*p (where p < q < r are distinct primes) in more ways than any smaller number.at n=12A237992
- Numbers using only digits 1 and 7.at n=38A276039
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) -2, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=44A294868
- a(n) = Sum_{k=1..n} k * tau(k)^2, where tau is A000005.at n=38A320896
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 7 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=7 and b=-1, respectively.at n=27A337630
- Odd composite integers m such that A086902(m) == 7 (mod m).at n=37A338079
- Number of partitions of n into 8 or more parts.at n=29A347544
- a(n) is the least number that can be written in exactly n ways as p*q + q*r + p*r where (p,q,r) is an unordered triple of distinct primes.at n=31A356457