8659
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9904
- Proper Divisor Sum (Aliquot Sum)
- 1245
- 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
- 7416
- Möbius Function
- 1
- Radical
- 8659
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 52
- 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
- Powers of fifth root of 17 rounded up.at n=16A018164
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=35A020411
- Multiplicity of highest weight (or singular) vectors associated with character chi_14 of Monster module.at n=42A034402
- Dirichlet convolution of b_n=2^(n-1) with Fibonacci numbers.at n=13A034734
- a(n) = n! * Sum_{k=1..n-1} 1/k!.at n=7A038156
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=41A060879
- Centered 13-gonal numbers.at n=36A069126
- Multiply by 1, add 1, multiply by 2, add 2, etc.at n=14A082459
- Round(1000*x), where x is the solution to x = 5^(n-x).at n=10A104744
- a(n) = Sum_{r < n, gcd(r,n)=1} n!/r!.at n=6A110377
- Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i.at n=22A121662
- Binomial transform of the "1,2,3,..." triangle.at n=48A125027
- Number of unordered rooted trees where each subtree from given node has the same number of nodes.at n=27A127524
- Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-1) for 2n>=k>0, T(n,2n-1) = T(n,2n-2) + T(n-1,n-1) and T(n,2n) = T(n,2n-1) + T(n-1,n-1) for n>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1.at n=45A132289
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (0, 0, 1), (0, 1, 1), (1, 1, 0), (1, 1, 1)}.at n=6A151249
- Numerator of Euler(n, 11/29).at n=3A157388
- Numbers n which equal the sum of the prime factors of n^2+1217*n+370313.at n=7A159004
- Number of distinct resistances that can be produced using at most n equal resistors in series and/or parallel, confined to the five arms (four arms and the diagonal) of a bridge configuration. Since the bridge requires a minimum of five resistors, the first four terms are zero.at n=11A174286
- Partial sums of A054247.at n=4A177793
- Number of (n+1)X2 0..3 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors.at n=2A205761