17088
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 45720
- Proper Divisor Sum (Aliquot Sum)
- 28632
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5632
- Möbius Function
- 0
- Radical
- 534
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=35A024686
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=34A025119
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=31A031563
- Sums of terms of groups in A075626.at n=31A075629
- a(n) = Sum_{k=0..n-1} sigma(2k+1)*sigma_3(n-k).at n=9A081860
- Coefficient [x^n] of the Maclaurin series for 2 - sqrt(1 - 4*x - 4*x^2).at n=9A179190
- Rectangular array: (row n) = b**c, where b(h) = h^3, c(h) = (n-1+h)^3, n>=1, h>=1, and ** = convolution.at n=32A213558
- Expansion of (psi(x^3) / psi(x))^2 in powers of x where psi() is a Ramanujan theta function.at n=32A217786
- Number of arrays of the median of three adjacent elements of some length n+2 0..7 array.at n=4A228739
- Number of arrays of the median of three adjacent elements of some length 7 0..n array.at n=6A228742
- Number of standard Young tableaux with n cells and 9 as last value in the first row.at n=3A245007
- Array read by upwards antidiagonals: A(n, k) = index of prime(k)^n in A098550.at n=46A253609
- Number of binary strings of length n+3 such that the smallest number whose binary representation is not visible in the string is 5.at n=14A261441
- Numbers k such that (16*10^k + 197) / 3 is prime.at n=21A280205
- G.f.: Sum_{n=-oo..+oo} (1 + x^n)^n / (1 - x^n)^n, ignoring the constant term.at n=34A292180
- p-INVERT of (1,2,3,5,8,...) (distinct Fibonacci numbers), where p(S) = (1 - S)^2.at n=8A292399
- Number of nX2 0..1 arrays with every element unequal to 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=14A304257
- Table read by antidiagonals upward: T(n,k) is the number of ways to move a chess queen from (1,1) to (n,k) in the first quadrant using only up, right, and diagonal up-left moves.at n=39A334017
- The hafnian of a symmetric Toeplitz matrix of order 2*n, n>=2 with the first row (0,1,2,...,2,1); a(0)=a(1)=1.at n=5A336114
- Triangular array read by rows. T(n,k) is the number of elements of rank k in the order complex of the poset P = [n] X [n], n=0, k=0 or n>0, 0<=k<=2n-1.at n=36A337192