17031
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
- 8
- Divisor Sum
- 25984
- Proper Divisor Sum (Aliquot Sum)
- 8953
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- -1
- Radical
- 17031
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 79
- 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
- no
- Odd
- yes
Appears in sequences
- Let S denote the palindromes in the language {0,1,2}*; a(n) = number of words of length n in the language SS.at n=12A007056
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=38A025004
- G.f.: 1 / Product_{k>=1} (1-x^k)^(k-1).at n=22A052847
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=26A061364
- Interprimes (A024675) which are of the form s*prime, s=21.at n=33A075296
- p^2-p+1 central polygonal numbers with prime indices A002061(prime(n)).at n=31A119959
- Number of intersection points of all lines through pairs of vertices of a regular n-gon.at n=18A146212
- Number of partitions of n containing a clique of size 1.at n=36A183558
- Position of 3^n in A051037 (5-smooth numbers).at n=44A188426
- Number of zero-sum nX3 -1..1 arrays with every element equal to at least one horizontal or vertical neighbor.at n=4A201842
- Number of zero-sum nX5 -1..1 arrays with every element equal to at least one horizontal or vertical neighbor.at n=2A201844
- T(n,k)=Number of zero-sum nXk -1..1 arrays with every element equal to at least one horizontal or vertical neighbor.at n=23A201847
- T(n,k)=Number of zero-sum nXk -1..1 arrays with every element equal to at least one horizontal or vertical neighbor.at n=25A201847
- L.g.f.: Sum_{n>=1} a(n)*x^n/n = Sum_{n>=1} x^n/n * exp( Sum_{k>=1} sigma(n*k)*x^(n*k)/k ).at n=20A203321
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3>x^3+y^3.at n=33A211811
- Numbers k such that k!4 + 2^8 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=27A291349
- Positive integers that have exactly ten representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=7A317400
- a(n) = (2*n+1)*(n^3-2*n^2+n+1).at n=10A347319