17136
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
- 60
- Divisor Sum
- 58032
- Proper Divisor Sum (Aliquot Sum)
- 40896
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 714
- Omega Function (Ω)
- 8
- 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
- 172
- 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
- Boustrophedon transform of natural numbers, cf. A000027.at n=8A000737
- Even minus odd extensions of truncated 3 X 2n grid diagram.at n=4A007724
- a(n) is the concatenation of n and 8n.at n=16A009470
- Powers of fifth root of 15 rounded down.at n=18A018156
- Theta series of A*_17 lattice.at n=65A023929
- a(n) = n*(n+1)*(5*n+1)/6.at n=26A033994
- For all n, if d is recursively applied to a(n) exactly 6 times then the fixed point of d-iteration is just reached.at n=22A036458
- Numbers that are the products of distinct substrings (>1) of themselves and do not end in 0.at n=22A059470
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,25.at n=4A064249
- a(n) = S2(n,5), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.at n=3A089668
- Index of first occurrence of n in A092931, or 0 if n does not appear.at n=39A092932
- Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=29A095182
- Where A007535 reaches a record.at n=36A098653
- Row sums of triangle A099575.at n=11A099576
- Triangle read by rows: T(n,k) is the number of nonroot nodes of outdegree k (0<=k<=n-1) in all non-crossing trees with n edges.at n=22A100400
- Triangle of Delannoy paths counted by number of diagonal steps not preceded by an east step.at n=50A110446
- Numbers k such that A056109(k) is a square.at n=4A122770
- G.f.: exp(x) = Product_{n>=1} [1 + a(2n-1)*x^(2n-1)/(2n-1)! + a(2n)*x^(2n)/(2n)! ].at n=9A137941
- Riordan array [(1-x)exp(x/(1-x)),x].at n=49A152151
- a(n) = 686*n - 14.at n=24A157363