8654
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12984
- Proper Divisor Sum (Aliquot Sum)
- 4330
- 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
- 4326
- Möbius Function
- 1
- Radical
- 8654
- 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
- 171
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=14A020439
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (composite numbers).at n=22A024461
- a(n) = [ C(2n,n)/2^(n+2) ].at n=18A024505
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=45A027575
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 92.at n=16A031590
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 44 ones.at n=31A031812
- Numbers whose set of base-14 digits is {2,3}.at n=22A032814
- Number of asymmetric (identity) trees with n nodes and 6 leaves.at n=8A055337
- Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.at n=32A090832
- Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6*k+5 for some k, where prime(n) denotes n-th prime.at n=16A090835
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=34A105233
- Triangle read by rows: T(n,k) is the number of Dyck n-paths (A000108) whose longest pyramid has size k.at n=57A120059
- Poincaré series [or Poincare series] P(C_{4,2}(0); t).at n=17A124637
- Numbers that are the product of two distinct primes and they are partial sum of products of two distinct primes.at n=23A168476
- Number of digits in the decimal expansion of the number of partitions of 6^n.at n=10A248733
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 62", based on the 5-celled von Neumann neighborhood.at n=27A270081
- Numbers k such that (26*10^k - 119)/3 is prime.at n=21A274238
- The smallest position with nim-value n in subtract-a-square game.at n=32A297963
- a(n) = 68*2^n - 50 (n>=1).at n=6A304518
- a(n) = Sum_{k=1..n} (k/gcd(n, k))^3.at n=15A343513