17316
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 48412
- Proper Divisor Sum (Aliquot Sum)
- 31096
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 2886
- Omega Function (Ω)
- 6
- 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
- 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
- Theta series of direct sum of 3 copies of hexagonal lattice.at n=31A008654
- Appending a digit to n^2 gives another perfect square.at n=19A031150
- Revert transform of (1 - x + 2x^2 - x^3)/(1 + 2x^2).at n=13A049142
- Number of different compositions of the ladder graph L_n.at n=6A078469
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 33 for n > 0.at n=20A101074
- Table of number of partitions of an m X n rectangle, read by descending antidiagonals.at n=22A110476
- Table of number of partitions of an m X n rectangle, read by descending antidiagonals.at n=26A110476
- G.f.: A(x) = x - A(-A(x)^2).at n=13A141366
- a(n) = 13*n*(n+1).at n=36A173307
- Numbers m such that A186711(m) = 1.at n=13A186771
- a(n) = n^2*(n+1)*(3*n+1)/4.at n=12A213827
- Numbers n such that 10*n^2+4 is a square.at n=2A239365
- Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of posets with n elements whose Hasse diagram has k connected components.at n=37A263864
- Triangle read by rows: T(n,k) is the number of ways to partition an n X k square grid into any number of parts along the gridlines.at n=16A264841
- Magic sums of 4 X 4 magic squares composed of squares.at n=34A271580
- Magic sums of 4 X 4 magic squares composed of odd squares.at n=3A271582
- Numbers k such that the decimal number concat(4,k) is a square.at n=35A273359
- Denominators of continued fraction convergents to sqrt(10)/2 = sqrt(5/2) = A020797 + 1.at n=17A295334
- a(n) = n*(2*n - 3 - (-1)^n)*(11*n + (-1)^n)/24.at n=26A308026
- Sum of the largest parts in the partitions of n into 6 parts.at n=36A308873