8679
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 3993
- 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
- 5240
- Möbius Function
- -1
- Radical
- 8679
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 171
- 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
- States of a dynamic storage system.at n=12A005594
- Sum along upward diagonal of Pascal triangle to center.at n=20A010752
- Sum along upward diagonal of Pascal triangle up to (but not including) center.at n=20A010753
- Number of distinct nonzero absolute values of Sum_{j=1..n} sigma_j * exp(i * Pi * j / n) where sigma_j = +- 1.at n=20A013914
- T(n,0) + T(n,1) + ... + T(n,n), T given by A026670.at n=12A026677
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026670.at n=13A026678
- a(n) = Sum_{k=0..floor(n/2)} T(n,k), T given by A026725.at n=13A026733
- T(n,n-4), array T as in A038730.at n=6A038733
- T(n,n-6), array T as in A038792.at n=14A038796
- Expansion of g.f. (1+x)*Product_{m>0} (1 + x^m).at n=52A052816
- Convolution of (shifted) A026671 with A000984 (central binomial coefficients of even order).at n=7A054441
- G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).at n=46A083709
- a(n) = Sum_{i=1..n} i^2*t(i), where t = A000217.at n=8A086689
- Number of distinct products i*j*k*l for 1 <= i <= j <= k <= l <= n.at n=29A100437
- Numbers k such that k and k^2 together contain all ten digits.at n=26A122477
- Odd interprimes divisible by 11.at n=41A126230
- a(n) = (2n-1)!! * Sum_{k=0..n-2}(-1)^k/(2k+1).at n=5A135457
- a(n) = n*(8*n-1).at n=33A139274
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (-1, 0), (0, -1), (0, 1), (1, -1), (1, 1)}.at n=6A151314
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2^k if k <= floor(n/2) otherwise 2^(n-k), and m = 1, read by rows.at n=30A157268