9044
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 11116
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 4522
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 21
- 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
- If x and y are terms, so is x*y + 9.at n=42A009350
- a(n) = floor(binomial(n,6)/6).at n=21A011852
- n is equal to the number of 3s in all numbers <= n written in base 5.at n=15A014895
- Expansion of 1/(1-4*x)^(17/2).at n=3A020928
- Least term in period of continued fraction for sqrt(n) is 10.at n=19A031434
- "DHK[ 5 ]" (bracelet, identity, unlabeled, 5 parts) transform of 1,1,1,1,...at n=33A032246
- Number of partitions of n with equal number of parts congruent to each of 1, 2 and 4 (mod 5).at n=59A035579
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=13A049974
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^4.at n=9A053820
- Triangle A(n,m) of numbers of n-element ordered T_0-antichains on an unlabeled m-set or numbers of T_1-hypergraphs on n labeled nodes with m (not necessarily empty) distinct hyperedges (m=0,1,...,2^n).at n=28A059048
- Fifth diagonal (m=4) of triangle A084938; a(n) = A084938(n+4,n) = (n^4 + 18*n^3 + 131*n^2 + 426*n)/24.at n=17A090386
- Triangle read by rows: T(k,s) = binomial(k+s,2s+1)*(2k-1)*(2k+1)/(2s+3), k >= 1, 0 <= s <= k-1.at n=41A111126
- Triangle read by rows: T(k,s)=(2k-1)(2k+1)binomial(2k-s-1,2k-2s-1)/(2k-2s+1); k>=1, 0<=s<=k-1.at n=39A111127
- a(n) = 2*n*(4*n-3).at n=34A139271
- a(n) = 361*n^2 + 19.at n=5A158592
- Multiples of 19 whose digit reversal - 1 is also a multiple of 19.at n=21A166399
- a(n) = 25*n^2 + n.at n=18A173089
- G.f. (x + 1)^10/(x^10 + x^9 - x^7 - x^6 - x^5 - x^4 - x^3 + x + 1).at n=29A173243
- Partial sums of A002025.at n=3A180219
- Number of nondecreasing strings of numbers x(i=1..6) in -n..n with sum x(i)^3 equal to 0.at n=30A188280