9587
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9588
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9586
- Möbius Function
- -1
- Radical
- 9587
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1184
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).at n=10A000101
- Smallest prime p such that there is a gap of 2n between p and previous prime.at n=17A001632
- Primes that remain prime through 2 iterations of function f(x) = 8x + 1.at n=24A023260
- Primes that remain prime through 3 iterations of function f(x) = 9x + 8.at n=29A023298
- Primes that remain prime through 4 iterations of the function f(x) = 9x + 8.at n=10A023326
- Primes that remain prime through 5 iterations of function f(x) = 9x + 8.at n=2A023354
- 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 97.at n=19A031595
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5).at n=33A039839
- Discriminants of imaginary quadratic fields with class number 23 (negated).at n=23A046020
- Prime islands: for n >= 2, a(n) = least prime whose adjacent primes are exactly 2n apart; a(1) = 3 by convention.at n=24A046931
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.at n=32A050666
- Numbers k such that 2*k! + 1 is prime.at n=15A051915
- 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=26A054808
- Second term of strong prime 5-tuples: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=25A054809
- Second term p(m) of strong prime sextets: p(m)-p(m-1) > 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=3A054814
- Integer nearest Riemann(10^n), where Riemann(x) = Sum_{k=1..infinity} mu(k)/k * Integral Log( x^(1/k) ).at n=4A057793
- Number of winning binary "same game" templates with ternary digits totaling n.at n=20A066346
- Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).at n=18A070735
- a(n) = 5^n + 7^n + 9^n.at n=4A074575
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 8*p+1 (A023228) is also prime.at n=29A075706