9770
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17604
- Proper Divisor Sum (Aliquot Sum)
- 7834
- 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
- 3904
- Möbius Function
- -1
- Radical
- 9770
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- yes
- Odd
- no
Appears in sequences
- Number of Hamiltonian circuits on 2n times 4 rectangle.at n=5A005389
- Number of Hamiltonian cycles in P_4 X P_n.at n=11A006864
- Square array read by antidiagonals of number of length k walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.at n=60A064044
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=37A116721
- Indices where A138554 requires only squares < floor(sqrt(n))^2.at n=34A138555
- Number of binary strings of length n with equal numbers of 001 and 010 substrings.at n=15A164141
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^2*x(i)^2 equal to n^2*4.at n=16A184233
- Least nonnegative number whose n-th arithmetic derivative (A003415) is zero and lower derivatives are nonzero.at n=15A189760
- Number of Hamiltonian cycles in P_12 X P_n.at n=3A213813
- Number of bipartite partitions of (i,j) with i+j = n into distinct pairs.at n=15A219555
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=29A229467
- Sum over all partitions lambda of n into 3 distinct parts of Product_{i:lambda} prime(i).at n=10A258358
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood.at n=23A270166
- p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S - S^4.at n=13A291401
- Number of length-rectangular twice-partitions of n.at n=22A306319
- Number of counterclockwise n-step spirals on hexagonal lattice where turns of 2*Pi/3 are forbidden.at n=15A309982
- Number of compositions of n whose circular differences are all 1 or -1.at n=46A325589
- Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows.at n=28A326914
- Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), k>=0, k<=n<=k*2^(k-1), read by columns.at n=48A326962
- Positions of records in A327966.at n=15A327967