14939
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14940
- 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
- 14938
- Möbius Function
- -1
- Radical
- 14939
- 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
- 71
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1749
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=40A024847
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=11A031842
- Primes p that have exactly three primitive roots that are not primitive roots mod p^2.at n=3A060519
- a(n) is the least positive integer k such that g(k) = n*g(k-1), where g(k) = prime(k+1) - prime(k).at n=22A078563
- Records in A079372.at n=15A079373
- a(n) = 8*n^2 + 88*n + 43.at n=38A086760
- Primes p such that p^2+p-1 and p^2+p+1 are twin primes.at n=39A088483
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=40A097240
- Primes of the form (k+1)*prime(k) + k*prime(k+1).at n=17A097241
- Value of C in y = x^2+7x+C such that y is prime for all x = 0 to 4.at n=22A097436
- Sophie Germain primes for which the reversal is also a Sophie Germain prime.at n=20A118573
- Primes with prime "Look And Say" descriptions from right to left (irrespective of method A or method B).at n=37A127179
- Prime numbers p such that 2*p+1, p*(p + 1) - 1 and p*(p + 1) + 1 are also primes.at n=14A136015
- Primes of the form 210k + 29.at n=38A140845
- Primes congruent to 15 mod 41.at n=38A142212
- Primes congruent to 40 mod 47.at n=36A142391
- Primes congruent to 46 mod 53.at n=32A142576
- Primes congruent to 12 mod 59.at n=31A142739
- Primes congruent to 55 mod 61.at n=29A142853
- Primes p such that p^3-p-+1 are twin primes.at n=24A158295