9077
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
- 4
- Divisor Sum
- 9420
- Proper Divisor Sum (Aliquot Sum)
- 343
- 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
- 8736
- Möbius Function
- 1
- Radical
- 9077
- 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
- 65
- 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
- Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.at n=20A002559
- a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3.at n=34A022878
- Multiplicity of highest weight (or singular) vectors associated with character chi_57 of Monster module.at n=37A034445
- Nonprime numbers k such that sum of aliquot divisors of k is a cube.at n=30A048698
- Define C(n) by the recursion C(0) = 1 + I where I^2 = -1, C(n+1) = 1/(1+C(n)); then a(n) = (-1)^n/Im(C(n)) where Im(z) is the imaginary part of the complex number z.at n=9A069921
- Number of solid partitions asymmetric under rotation operation.at n=12A096576
- Non-Fibonacci Markoff numbers.at n=10A111032
- k times k+4 gives the concatenation of two numbers m and m-5.at n=1A116254
- Positive numbers y such that y^2 is of the form x^2+(x+313)^2 with integer x.at n=7A160574
- Positive integers of the form (6*m^2 + 1)/11.at n=23A179337
- Markov numbers that are semiprime.at n=5A182585
- Composite Markoff numbers.at n=8A256395
- Array of Markov triples (x,y,z) sorted by z, read by rows.at n=62A291694
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 2, a(2) = 0, a(3) = 1.at n=21A295682
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 2, a(2) = 1, a(3) = 1.at n=20A295690
- Second member m_2(n) of the Markoff triple MT(n) with largest member m(n) = A002559(n), and smallest member m_1(n) = A305313(n), for n >= 1. These triples are conjectured to be unique.at n=39A305314
- Second member m_2(n) of the Markoff triple MT(n) with largest member m(n) = A002559(n), and smallest member m_1(n) = A305313(n), for n >= 1. These triples are conjectured to be unique.at n=46A305314
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=7A305362
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=47A305367
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=52A305367