8653
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9180
- Proper Divisor Sum (Aliquot Sum)
- 527
- 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
- 8128
- Möbius Function
- 1
- Radical
- 8653
- 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
- 140
- Smith Number
- yes
- 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
- Total diameter of unlabeled trees with n nodes.at n=12A001851
- a(n+1) = (n+1)*a(n) + Sum_{k=1..n-1} a(k)*a(n-k).at n=6A006014
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MEL = ZSM-11 Nan[AlnSi96-nO192] starting with a T1 atom.at n=12A019148
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFS = ZSM-57 H1.5[Al1.5Si34.5O72] starting with a T5 atom.at n=12A019173
- a(n) = n*(15*n - 1)/2.at n=34A022272
- Numbers k such that j(k)*phi(k) = sigma(phi(k)), j(k) = A033831(k).at n=7A033856
- n plus a googol is prime.at n=23A049014
- Boris Stechkin's function.at n=27A055004
- S[A002808(n)] where S[] is Boris Stechkin's function (A055004) and A002808(n) are the composites.at n=18A063483
- a(n) = 4*(n+1)*n + 5.at n=46A078370
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.at n=30A086769
- Floor of area of triangle with consecutive prime sides.at n=32A096377
- Expansion of g.f. (1-x-2*x^2-x^3+x^4)/((x-1)^3*(6*x^2+2*x-1)).at n=7A107307
- Numbers k such that sigma(k) and phi(k) are both triangular numbers.at n=7A113930
- E.g.f. satisfies: A(x) = exp(x*A(sin(x)*x)).at n=7A141627
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 10000-11100-00111-00001 pattern in any orientation.at n=13A147377
- Numbers which yield a prime whenever a 3 is prefixed, appended or inserted.at n=42A158594
- a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range.at n=46A165584
- Numbers n such that 10^n - 81 is prime.at n=13A178437
- a(n) = 5*n^2 - 4*n + 1.at n=42A190816