11587
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11588
- 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
- 11586
- Möbius Function
- -1
- Radical
- 11587
- 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
- 55
- 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
- 1394
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=25A031828
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=18A045277
- Discriminants of imaginary quadratic fields with class number 13 (negated).at n=29A046010
- Primes or negative values of primes in the sequence b(n) = 47*n^2 - 1701*n + 10181, n >= 0.at n=37A050267
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=29A054810
- Coefficients of replicable function number "32b".at n=36A058632
- Primes with 2 representations: p*q*r - 1 = u*v*w + 1 where p, q, r, u, v and w are primes.at n=33A063644
- Primes p such that both p-1 and p+1 have at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) <= 3 and bigomega(p+1) <= 3, where bigomega(n) = A001222(n).at n=39A079153
- Differences between the prime-counting function and Gauss's approximation for number of primes < 10^n.at n=10A106313
- Let p(n) be the n-th-prime. Sequence gives primes of the form | p(n)*p(n+2) - p(n+1)*p(n+3)| +1.at n=42A117854
- Primes of the form 47*n^2 - 1701*n + 10181.at n=16A128878
- Intersection of A061068 and A064270.at n=29A128996
- Primes of the form 210k + 37.at n=26A140847
- List of different primes in Pascal-like triangles with index of asymmetry y = 3 and index of obliquity z = 0 or z = 1.at n=4A141068
- Primes congruent to 6 mod 37.at n=35A142115
- Primes congruent to 25 mod 41.at n=33A142222
- Primes congruent to 20 mod 43.at n=36A142269
- Primes congruent to 25 mod 47.at n=28A142376
- Primes congruent to 23 mod 49.at n=33A142433
- Primes congruent to 10 mod 51.at n=42A142482