17568
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 50778
- Proper Divisor Sum (Aliquot Sum)
- 33210
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 0
- Radical
- 366
- Omega Function (Ω)
- 8
- 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
- 97
- 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
- a(n) = n^3 - floor( n/3 ).at n=26A002901
- Theta series of direct sum of 3 copies of D_4 lattice.at n=3A008659
- Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=46A035544
- Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=23A035594
- Gaps of 7 in sequence A038593 (lower terms).at n=38A038653
- Numbers k such that 2^k - 17 is prime.at n=36A059611
- a(n) = Min{x : A073124(x) = 2n}.at n=47A096480
- Triangular matrix, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) when n>k>=0, with T(n,n) = (2*n+1).at n=16A102320
- Column 1 of triangular matrix A102320, which that satisfies: T(n,k) = [T^2](n-1,k) when n>k>=0, with T(n,n) = (2*n+1).at n=5A102322
- Unreduced numerators of the elements T(n,k)/(n-k)!, read by rows, of the triangular matrix P^-1, which is the inverse of the matrix defined by P(n,k) = (-k^2-k)^(n-k)/(n-k)! for n >= k >= 1.at n=17A103244
- Triangle read by rows: T(n,k) is the number of Delannoy paths of length n, having k EE's and NN's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1 or two consecutive N steps from the line y = x-1 to the line y = x+1).at n=23A110123
- Row sums of unsigned A128090.at n=11A128091
- Convolution triangle of A006190.at n=39A132964
- G.f. satisfies: A(x) = A(x^2)^2 + x*A(x^2)^3.at n=27A174512
- Numbers p^5*q^2*r where p, q, r are 3 distinct primes.at n=32A179691
- Number of 3-step king's tours on an n X n board summed over all starting positions.at n=18A186862
- Number of n X 2 0..2 arrays with row sums equal and column sums unequal to adjacent columns.at n=8A203485
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=7A207271
- Number of (w,x,y,z) with all terms in {1,...,n} and w>=2x and y<3z.at n=17A212520
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,-2,1.at n=17A222148