8574
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
- 17160
- Proper Divisor Sum (Aliquot Sum)
- 8586
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2856
- Möbius Function
- -1
- Radical
- 8574
- 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
- 127
- 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
- yes
- Odd
- no
Appears in sequences
- Number of graphical basis partitions of 2n.at n=27A001130
- Number of unlabeled bisectable trees with 2n+1 nodes.at n=10A007098
- One half of the number of non-self-conjugate balanced partitions.at n=53A067772
- a(n) is the sum of the preceding terms that are coprime to n.at n=24A082865
- The number of closed lambda calculus terms of size n, where size(lambda x.M)=2+size(M), size(M N)=2+size(M)+size(N), and size(V)=1+i for a variable V bound by the i-th enclosing lambda (corresponding to a binary encoding).at n=24A114852
- Numbers whose square is a permutational number A134640.at n=26A134742
- Number of non-Fibonacci parts in all partitions of n.at n=28A144116
- G.f. (x^10 +x^9 +x^8 +.... +x+1) / (x^10 +x^9 -x^7 -x^6 -x^5 -x^4 -x^3 +x +1).at n=56A173244
- Number of partitions of n containing at least one part m-5 if m is the largest part.at n=33A212545
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 3.at n=32A259583
- Magic sums of 4 X 4 semimagic squares composed of consecutive primes.at n=16A270864
- Number of nX5 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=10A280856
- Partial sums of A299266.at n=22A299267
- Even numbers n such that A048633(n+1) = A048633(n).at n=33A331586
- Positive numbers k such that k and k + 1 are both positive negabinary-Niven numbers (A331728) and -k and -(k + 1) are both negative negabinary-Niven numbers (A331819).at n=37A331829
- Expansion of Sum_{k>0} (1/(1-x^k)^6 - 1).at n=12A363696
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=33A367297
- Expansion of 1/sqrt(1 - 4*x^3/(1 - x)^2).at n=14A376809