11339
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 1621
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9856
- Möbius Function
- -1
- Radical
- 11339
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(27*n - 1)/2.at n=29A022284
- Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.at n=39A065148
- Frobenius number of the numerical semigroup generated by consecutive hex numbers.at n=4A069759
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=3.at n=15A079116
- a(n) = Product of k primes in arithmetic progression with common difference 6, otherwise a(n) = prime(n).at n=4A120313
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=34A152943
- a(n) = 324n - 1.at n=34A158306
- The second left hand column of triangle A167552.at n=33A167554
- The odd composites c such that c=q*g*j*y/2 and q+g=j*y where q,g,j,y are distinct primes.at n=25A167629
- For any number n take the polynomial formed by the product of the terms (x-pi), where pi's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is equal to zero.at n=32A203614
- Composite squarefree numbers k such that the arithmetic mean of the distinct prime factors of k is a prime p, and p divides k.at n=23A229094
- Products of three distinct primes that form an arithmetic progression.at n=17A262723
- Denominator of Product_{j=1..n-1} ((3*j+1)/(3*j+2)).at n=9A271920
- Denominator of n*Product_{j=1..n-1} ((3*j + 1)/(3*j + 2)).at n=9A271922
- Product of the n-th sexy prime triple.at n=1A286217
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=15A294365
- Numbers x that are equal to lpf(x)*gpf(x)*(lpf(x)+gpf(x))/2, where lpf(x) < gpf(x) are the least and the greatest prime factors of x: A020639 and A006530.at n=19A307108
- Numbers x that are equal to lpf(x)*gpf(x)*(lpf(x)+gpf(x))/2, where lpf(x) and gpf(x) are the least and the greatest prime factors of x: A020639 and A006530.at n=27A307117
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=4A316810
- Number of n X 5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=2A316812