8579
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8976
- Proper Divisor Sum (Aliquot Sum)
- 397
- 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
- 8184
- Möbius Function
- 1
- Radical
- 8579
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Site percolation series for square lattice.at n=19A006731
- Denominators of continued fraction convergents to sqrt(263).at n=11A041493
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=43A050069
- Let p = n-th prime of the form 4k+3, take the solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and smallest y >= 1; sequence gives value of y.at n=29A082394
- Numbers k such that k divides Sum_{j=1..k} j^j = A001923(k).at n=10A128981
- a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any four consecutive digits in the sequence sum up to a prime.at n=44A152604
- a(n) = 12167n - 3588.at n=0A156846
- Number of nondecreasing arrangements of n+3 numbers in 0..4 with each number being the sum mod 5 of three others.at n=15A183899
- Expansion of (1-x+19*x^3-3*x^4)/(1-x)^3.at n=34A195241
- a(n) = n + floor( n^2/2 + n^3/3 ).at n=29A236773
- (p^2 - 3)/2 for odd primes p.at n=30A243887
- a(1) = 2, and for n>1: a(n) = prime(A251719(n)) * prime(A251719(n) + n - 2), where prime(n) gives the n-th prime.at n=66A251724
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 438", based on the 5-celled von Neumann neighborhood.at n=26A272219
- Coefficients in expansion of (q*j(q))^(-1/12) where j(q) is the elliptic modular invariant (A000521).at n=2A299826
- Number of nX4 0..1 arrays with every element equal to 0, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=8A300678
- Lengths of largest face diagonal in primitive Euler bricks or Pythagorean cuboids: possible values of max(d, e, f) for solutions to a^2 + b^2 = d^2, a^2 + c^2 = e^2, b^2 + c^2 = f^2 in coprime positive integers a, b, c, d, e, f.at n=14A306120
- Discriminants of imaginary quadratic fields with class number 42 (negated).at n=30A351680
- Indices k such that A358128(k) is a square.at n=34A358130
- a(n) = Sum_{k=0..n} floor(sqrt(k))^4.at n=33A363498
- Numbers k such that A163511(k) is a fifth power.at n=22A365802