code: def is_cyclic_number(n) -> bool:
      """
      Check whether `n` is a cyclic number. A number `n` is said to be cyclic
      if and only if every finite group of order `n` is cyclic. For more
      information see [1]_.
  
      Examples
      ========
  
      >>> from sympy.combinatorics.group_numbers import is_cyclic_number
      >>> from sympy import randprime
      >>> is_cyclic_number(15)
      True
      >>> is_cyclic_number(randprime(1, 2000)**2)
      False
      >>> is_cyclic_number(4)
      False
  
      References
      ==========
  
      .. [1] Pakianathan, J., Shankar, K., Nilpotent Numbers,
             The American Mathematical Monthly, 107(7), 631-634.
      .. [2] https://oeis.org/A003277
  
      """
      n = as_int(n)
      if n <= 0:
          raise ValueError("n must be a positive integer, not %i" % n)
      factors = factorint(n)
      return all(
          e == 1 for e in factors.values()
      ) and _is_nilpotent_number(factors)
  
file_path: sympy/sympy/combinatorics/group_numbers.py
imports: from itertools import chain, combinations
  from sympy.external.gmpy import gcd
  from sympy.ntheory.factor_ import factorint
  from sympy.utilities.misc import as_int
label_desc: Use image node_id 4 for calling a global function with example usage: is_cyclic_number(n) and returns: unknown