17346
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 41040
- Proper Divisor Sum (Aliquot Sum)
- 23694
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4872
- Möbius Function
- 0
- Radical
- 2478
- Omega Function (Ω)
- 5
- 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
- 141
- 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
- Expansion of (1-x^6) / (1-x)^6.at n=16A008488
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=35A023073
- If n mod 2 = 0 then 2*Sum(floor(C(n,w)/(2*w+1)),w=0..n/2-1)+floor(C(n,n/2)/(n+1)) otherwise 2*Sum(floor(C(n,w)/(2*w+1)),w=0..(n-1)/2).at n=18A085570
- a(n) = n^2*(n+1)^2*(4*n^2 - 5*n + 4)/12.at n=6A101381
- a(n) = binomial(n+6,5) - binomial(n,5).at n=15A120478
- Number of partitions p of n such that the number of parts is not a part and max(p) - min(p) is a part.at n=46A241383
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) = number of distinct parts of p.at n=49A241820
- Number of n X 3 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=4A269047
- T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=25A269052
- Number of 5Xn 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=2A269056
- a(n) = (1/48)*n*(n+5)^2*(1*n^3 + 7*n^2 + 16*n + 28).at n=7A290071
- Number of broken 3-diamond partitions of n.at n=15A328541
- Infinitary Ruth-Aaron numbers: numbers k such that A181894(k) = A181894(k+1).at n=18A330999
- Unitary Ruth-Aaron numbers: numbers k such that A008475(k) = A008475(k+1).at n=15A331000
- Number of relatively prime strict compositions of n with no 1's.at n=33A337451
- Numbers that are the sum of six fourth powers in four or more ways.at n=28A345561
- Numbers that are the sum of six fourth powers in exactly four ways.at n=26A345816
- Number of ways to write a + b + c = d + e = f with {a,b,c,d,e,f} a subset of [n] of size 6 and a < b < c and d < e.at n=40A362717
- G.f.: Sum_{k>=0} 2^k * x^(k*(k+1)) / Product_{j=1..k} (1 - x^j).at n=52A376947