9441
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13650
- Proper Divisor Sum (Aliquot Sum)
- 4209
- 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
- 6288
- Möbius Function
- 0
- Radical
- 3147
- Omega Function (Ω)
- 3
- 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
- 104
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=43A024836
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 46 ones.at n=36A031814
- Numbers k such that 5*2^k + 3 is prime.at n=46A058586
- a(n) is the number of integer lattice points inside the right triangle with legs 3n and 4n (and hypotenuse 5n).at n=39A126587
- Record values in A046641.at n=29A145771
- Maximal entry in row n of triangle in A169950.at n=15A169954
- a(n) = 9*n^2 - 11*n + 3.at n=32A214660
- Partial sums of A160239.at n=39A245542
- Numbers n such that both n*log(2) and n*log(3) are within 1/sqrt(n) of integers.at n=33A259483
- Integers k such that A086167(k) and A086168(k) are both prime.at n=41A270563
- Numbers k such that (89*10^k - 179)/9 is prime.at n=16A295129
- Numbers n such that there are precisely 2 groups of orders n, n + 1 and n + 2.at n=37A296022
- Partial sums of A301697.at n=59A301698
- Numbers k such that k![4] - 1024 is prime, where k![4] = A007662(k) = quadruple factorial.at n=35A329184
- Numbers k such that A335660(k) = 2.at n=46A335662
- G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies: [Sum_{n>=0} x^n/(1 - x^(n+1))]^3 = Sum_{n>=0} a(n)*x^n/(1 - x^(n+1))^3.at n=35A341374
- Odd numbers for which sigma(k) is congruent to 2 modulo 4 and the 3-adic valuation of k is one larger than the 3-adic valuation of sigma(k).at n=35A351534
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 3 - x^2.at n=46A368152
- Number of solutions to +- 1^2 +- 2^2 +- 3^2 +- ... +- n^2 = n^2.at n=24A368243