5939
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5940
- 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
- 5938
- Möbius Function
- -1
- Radical
- 5939
- 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
- 142
- 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
- 780
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=39A000353
- Magnetic susceptibility coefficients for square lattice spin 2 Ising model.at n=32A010116
- a(n) = prime(n*(n+1)/2).at n=38A011756
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=22A023300
- Right-truncatable primes: every prefix is prime.at n=38A024770
- Number of graphical partitions (degree-vectors for graphs with n vertices, allowing self-loops which count as degree 1; or possible ordered row-sum vectors for a symmetric 0-1 matrix).at n=8A029889
- 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 77.at n=1A031575
- Lower prime of a pair of consecutive primes having a difference of 14.at n=32A031932
- Recursive prime generating sequence.at n=40A039726
- Numbers whose base-5 representation contains exactly three 2's and two 4's.at n=16A045291
- Primes of the form n*phi(n)-1 where phi is the Euler function (in order of appearance).at n=40A046078
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.at n=19A050666
- Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6*n.at n=16A052356
- Primes for which some rearrangement of the digits (leading zeros not allowed) is the product of two consecutive primes.at n=39A053652
- Run through primes p; if the digits of p*q (where q is the prime following p) can be rearranged to form one or more primes r, append these primes r to the sequence.at n=38A053736
- 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=6A054682
- Third term of weak prime quintets: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=14A054825
- Primes of the form 4*k^2 + 163.at n=32A057604
- Numbers k such that 77^k - 76^k is prime.at n=2A062643
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=6A070018