8565
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13728
- Proper Divisor Sum (Aliquot Sum)
- 5163
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4560
- Möbius Function
- -1
- Radical
- 8565
- Omega Function (Ω)
- 3
- 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
- 26
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(19*n + 1)/2.at n=30A022277
- Numbers k such that k^2 is palindromic in base 14.at n=23A030072
- Numbers having three 6's in base 9.at n=34A043479
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=42A052335
- Numbers k such that the Lucas Aurifeuillian primitive part A of Lucas(k) is prime.at n=43A061442
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=30A081378
- Expansion of (2*x+1)*(4*x^2+8*x+1)/((3*x^2+3*x+1)*(2*x^3+2*x^2+4*x+1)).at n=7A110689
- Lengths of bit runs in A123504.at n=42A123505
- Numbers of the form m = p1 * p2 * p3 where for each d|m we have (d+m/d)/2 prime and p1 < p2 < p3 each prime.at n=37A128284
- Triangle t(n,m) = 2*A008292(n+1,m+1) - A007318(n,m), a linear combination of Eulerian numbers and Pascal's triangle, 0 <= m <= n.at n=30A141690
- Triangle t(n,m) = 2*A008292(n+1,m+1) - A007318(n,m), a linear combination of Eulerian numbers and Pascal's triangle, 0 <= m <= n.at n=33A141690
- A linear combination of A008292 and A130595: t(n,m)=2*A008292(n,m)- A130595(n,m).at n=30A141903
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1010-1111-0100 pattern in any orientation.at n=13A146640
- Partial sums of floor(n^2/5) (A118015).at n=50A181640
- a(n) = (n+1)*(n^3+15*n^2+74*n+132)/12.at n=14A217947
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=45A231396
- Number of (1+1) X (n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=9A231397
- Number of partitions p of n such that the number of parts having multiplicity 1 is a part or max(p) - min(p) is a part.at n=34A241451
- Expansion of (Product_{k>0} (1 - x^k) / (1 - x^(5*k)))^5 in powers of x.at n=28A285932
- Sum of the odd parts in the partitions of n into 4 parts.at n=39A309517