6611
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7224
- Proper Divisor Sum (Aliquot Sum)
- 613
- 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
- 6000
- Möbius Function
- 1
- Radical
- 6611
- 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
- 49
- 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
- Divisors of 2^50 - 1.at n=16A003554
- Indices of prime Cullen numbers: numbers k such that k*2^k + 1 is prime.at n=4A005849
- Positive integers n such that 2^n == 2^11 (mod n).at n=65A015935
- a(n) = sum of squares of first n positive integers congruent to 1 mod 4.at n=10A024381
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=48A025196
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 81.at n=4A031579
- Number of partitions of n into parts not of the form 17k, 17k+8 or 17k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=33A035969
- Number of primes between n*100000 and (n+1)*100000.at n=34A038825
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(4,5) + cn(3,5).at n=31A039844
- Semiprimes p1*p2 such that p2>p1 and p2 mod p1 = 7.at n=34A064905
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.at n=12A064976
- A puzzle: reverse digits of n^2 + 10.at n=34A097990
- A puzzle: reverse digits of n^2 + 10.at n=34A097991
- Numbers whose anti-divisors sum to a perfect cube.at n=14A109351
- Consider the array T(n, m) where the n-th row is the sequence of integer coefficients of A(x), where 1<=a(n)<=n, such that A(x)^(1/n) consists entirely of integer coefficients and where m is the (m+1)-th coefficient. This is the row sum of A to the first coefficient of one.at n=20A112285
- Semiprimes (A001358) made of nontrivial runs of identical digits.at n=14A116063
- Number of permutations of length n which avoid the patterns 231, 1423, 3214.at n=14A116717
- Semiprimes that are semiprimes turned upside-down.at n=38A119738
- Multiples of 11 containing an 11 in their decimal representation.at n=21A121031
- The first 8 values are predefined, the remaining set to a(n) = 48*prime(n)+n+2.at n=32A129025