11087
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11088
- 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
- 11086
- Möbius Function
- -1
- Radical
- 11087
- 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
- 205
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1344
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n in which the least part is even.at n=44A026805
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=15A045277
- Primes p from A031924 such that A052180(primepi(p)) = 13.at n=18A052233
- Smallest prime p having n different cycles in decimal expansions of k/p, k=1..p-1.at n=22A054471
- Column 6 of triangle A055898.at n=5A055902
- Primes p such that p^12 reversed is also prime.at n=30A059705
- A060448 sorted and duplicates removed.at n=24A060636
- a(1)=1, a(2)=8; for n >= 1, a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.at n=58A069218
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=17A070902
- Smallest balanced prime of order n.at n=41A082080
- Diagonal of A088262.at n=34A088263
- Numbers k such that 30*k^2 + 6 is a square.at n=3A133283
- Cyclops primes.at n=22A134809
- a(n) is n-th prime == -1 (mod 6n).at n=27A138905
- Primes congruent to 20 mod 31.at n=42A142024
- Primes congruent to 24 mod 37.at n=36A142133
- Primes congruent to 17 mod 41.at n=32A142214
- Primes congruent to 36 mod 43.at n=33A142285
- Primes congruent to 42 mod 47.at n=25A142393
- Primes congruent to 13 mod 49.at n=35A142425