9104
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 17670
- Proper Divisor Sum (Aliquot Sum)
- 8566
- 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
- 4544
- Möbius Function
- 0
- Radical
- 1138
- Omega Function (Ω)
- 5
- 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
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Sum of Gaussian binomial coefficients for q=9.at n=4A015195
- Convolution of (1, p(1), p(2), ...) and (F(2), F(3), F(4), ...).at n=14A023628
- Multiplicity of highest weight (or singular) vectors associated with character chi_50 of Monster module.at n=41A034438
- Number of partitions of n into parts not of the form 25k, 25k+5 or 25k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036004
- Length of period of the continued fraction for sqrt(n!).at n=18A064025
- a(0)=1, a(n) is the smallest integer >= a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals the number of elements in this continued fraction.at n=46A070900
- a(n) is the n-th new record value in A073300.at n=29A073301
- a(0) = -1, a(1) = 2; a(n) = 2*a(n-1) + a(n-2).at n=11A078343
- a(n+1)=a(n)+a(n-1) if a(n-1) odd, a(n+1)=a(n)+a(n-1)/2 if a(n-1) even.at n=22A078696
- Greedy frac multiples of sqrt(2): a(1)=1, Sum_{n>=0} frac(a(n)*x)=1 at x=sqrt(2).at n=15A079934
- Numbers k such that k!!!!! - 1 is prime.at n=51A085149
- Number of rooted 8-dimensional "polycubes" with n cells, with no symmetries removed.at n=3A094101
- Column 4 of A048790.at n=8A094160
- Triangle T(n, k) = (k-n)*A000129(k+1) + (3*n-3*k+1)*A000129(k) with T(n,0) = 1, for 0 <= k <= n-1, read by rows.at n=77A117895
- The length of Sapro's necklace at successive years in Werneck's Black Pearl Necklace problem.at n=20A140261
- Numbers x such that 0 < |x^7 - y^2| < x^(5/2) for some number y.at n=7A173348
- Values x for records of minima of the positive distance d between the seventh power of a positive integer x and the square of an integer y such that d = x^7 - y^2 (x <> k^2 and y <> k^7).at n=22A179785
- Up-down permutations on [n] whose peaks have k rises.at n=34A194354
- Triangle read by rows: T(n,k) is the number of down-up permutations on [n] whose peaks have k rises.at n=37A194365
- Number of equivalence classes of S_n under transformations of positionally adjacent elements of the form abc <--> acb where a<b<c.at n=8A210667