5591
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5592
- 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
- 5590
- Möbius Function
- -1
- Radical
- 5591
- 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
- 67
- 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
- 738
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists.at n=16A000230
- Related to population of numbers of form x^2 + y^2.at n=14A000709
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=33A001583
- Increasing gaps between prime-powers.at n=13A002540
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=14A020411
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=45A024840
- Numbers whose least quadratic nonresidue (A020649) is 11.at n=34A025024
- Lower prime of a record difference between it and the second prime after it.at n=12A031133
- 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 73.at n=24A031571
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/10) starts with n.at n=37A034075
- Multiplicity of highest weight (or singular) vectors associated with character chi_99 of Monster module.at n=44A034487
- Sequence of 2 Pythagorean triangles, each with a leg and hypotenuse prime. The leg of the second triangle is the hypotenuse of the first.at n=22A048270
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.at n=7A054682
- Fourth term of weak prime quintets: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=13A054826
- Fourth spoke of a hexagonal spiral.at n=43A056108
- Numbers k such that 30*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A056680
- Primes p such that x^43 = 2 has no solution mod p.at n=17A059243
- Primes with 11 as smallest positive primitive root.at n=28A061324
- Smallest prime p such that there is a gap of 2^n between p and the next prime.at n=5A062529
- a(n) = Min{ q prime | nextprime(q) - q - 1 = prime(n)}, or 0 if none exist.at n=9A063793