11813
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11814
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11812
- Möbius Function
- -1
- Radical
- 11813
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1416
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- "Half-Catalan numbers": a(n) = Sum_{k=1..floor(n/2)} a(k)*a(n-k) with a(1) = 1.at n=15A000992
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=84A013583
- Numbers k such that the continued fraction for sqrt(k) has period 71.at n=6A020410
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 23.at n=17A051964
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=30A054808
- Primes p(k) such that the product of digits of p(k) equals the product of digits of k.at n=14A066521
- Prime(n) and prime(n+3) use the same digits.at n=12A069795
- Smaller of two consecutive Sophie Germain primes with the same digital sum.at n=28A118506
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 8.at n=21A119595
- Least prime p for which Mertens's function M(p) = n.at n=39A123172
- Prime chain of 128 terms, including 104 distinct primes, consisting of the output of eight equations that alternate sequentially within a procedural expression of a single polynomial. The equations are either subsequences of x^2 - 79x + 1601 or transforms with one exception: 100x^2 - 2260x + 12959. The other four distinct equations are Euler-derived: 25x^2 - 1185x + 14083, 25x^2 - 775x + 6047, 100x^2 - 2280x + 13159, 100x^2 - 4160x + 43427.at n=8A140708
- Primes of the form 210k + 53.at n=29A140851
- Primes congruent to 10 mod 37.at n=38A142119
- Primes congruent to 5 mod 41.at n=40A142202
- Primes congruent to 31 mod 43.at n=33A142280
- Primes congruent to 16 mod 47.at n=30A142367
- Primes congruent to 4 mod 49.at n=32A142417
- Primes congruent to 47 mod 53.at n=29A142577
- Primes congruent to 43 mod 55.at n=35A142632
- Primes congruent to 14 mod 57.at n=37A142674