5839
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5840
- 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
- 5838
- Möbius Function
- -1
- Radical
- 5839
- 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
- 217
- 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
- 766
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of matrix bundles of codimension n (Euler transform of A001156).at n=19A007864
- Next prime after n^3.at n=18A014220
- 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 75.at n=22A031573
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 66 ones.at n=1A031834
- Multiplicity of highest weight (or singular) vectors associated with character chi_30 of Monster module.at n=35A034418
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) <= cn(1,5).at n=54A036846
- a(1) = 6; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=34A046256
- T(n,n-3), array T given by A047010.at n=7A047015
- Euclid-Mullin sequence (A000945) with initial value a(1)=79 instead of a(1)=2.at n=12A051326
- a(n+1) = smallest prime p in the range a(n) < p < a(1)*a(2)*...*a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).at n=48A057459
- Primes p = prime(k) such that prime(k) + prime(k+5) = prime(k+1) + prime(k+4) = prime(k+2) + prime(k+3).at n=25A064101
- Record entries in A065191.at n=39A065192
- Primes p such that p + 4 is prime and p == 9 (mod 10).at n=42A074822
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 8.at n=41A075588
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].at n=15A078851
- The 6-tuples (d1,d2,d3,d4,d5,d6) with elements in {2,4,6} are listed in lexicographic order; for each 6-tuple, this sequence lists the smallest prime p >= 7 such that the differences between the 7 consecutive primes starting with p are (d1,d2,d3,d4,d5,d6), if such a prime exists.at n=16A078874
- Sorted version of A078874.at n=26A078875
- Primes p such that the differences between the 5 consecutive primes starting with p are (4,6,2,6).at n=6A078955
- Primes in A058633.at n=26A080822
- Class 5+ primes (for definition see A005105).at n=22A081633