11771
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12000
- Proper Divisor Sum (Aliquot Sum)
- 229
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11544
- Möbius Function
- 1
- Radical
- 11771
- 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
- 125
- 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
- Fibonacci numbers written backwards.at n=22A004091
- Reversals of Fibonacci numbers (sorted).at n=21A004170
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones.at n=4A031789
- Smallest k>1 such that k(p-1)-1 is divisible by p^2, p=n-th prime.at n=28A039914
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=40A051400
- Number of asymmetric monoids (semigroups with identity) of order n, considered to be equivalent when they are isomorphic or anti-isomorphic (by reversal of the operator).at n=6A058136
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=17A064112
- p^2-p-1 that is not prime, where p is prime.at n=15A119609
- Least semiprime s for which the Mertens function M(s) = n.at n=44A123173
- Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=4.at n=3A144744
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=7, k=0 and l=1.at n=6A177128
- Number of distinct sets of nonnegative integers with perimeter n, as defined in the comments.at n=45A182372
- Sum of all proper divisors of all positive integers <= prime(n).at n=43A244576
- Numbers k for which the digital sum of k contains the same distinct digits as k itself.at n=26A249515
- Numbers using only digits 1 and 7.at n=36A276039
- a(n) = (prime(1+n)*prime(n)) + prime(n) + 1.at n=27A286624
- Numbers that contain exactly one pair of identical digits x and a triple of identical digits y (x not equal y).at n=34A291312
- a(n) = p^2 - p - 1 where p = prime(n), the n-th prime.at n=28A306190
- a(n) = (p_n + 1)*q_n - 1; where (p_n, q_n) is the n-th twin prime pair.at n=9A328493
- Successive records of function f(x) = log(abs(pi(x) - R(x)))/log(x) where pi(x) is the number of primes <= x and R(x) is Riemann's prime counting function.at n=37A353055