14969
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14970
- 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
- 14968
- Möbius Function
- -1
- Radical
- 14969
- 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
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1753
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) is the least odd prime p such that the maximum run length of consecutive quadratic residues modulo p is n.at n=18A025046
- a(n) = (d(n)-r(n))/2, where d = A026049 and r is the periodic sequence with fundamental period (1,0,0,1).at n=40A026050
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=13A045307
- 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=36A054825
- 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=35A054826
- Fourth term of weak prime sextet: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=3A054831
- Primes of the form x^2 + (x+3)^2.at n=20A076727
- Evaluate n^4 - 93n^3 + 3196n^2 - 48008n + 265483 for n >= 0, record the primes.at n=11A095974
- Smallest prime p such that the maximum run length of consecutive positive quadratic residues modulo p is n.at n=19A097159
- Primes with digit sum = 29.at n=36A106766
- a(n)= a(n-1) +3*a(n-2) -3*a(n-4).at n=15A107384
- Primes p such that there exist three primes q, r and s with p^3=q^3+r^3+s^3.at n=25A114923
- Prime quartet leaders: largest number of a prime quartet.at n=36A119892
- a(n)=4n^4-3n^3+2n^2-n+1.at n=8A131465
- Primes of the form 210k + 59.at n=36A140852
- Primes congruent to 23 mod 47.at n=37A142374
- Primes congruent to 23 mod 53.at n=31A142553
- Primes congruent to 9 mod 55.at n=38A142608
- Primes congruent to 42 mod 59.at n=33A142769
- Primes congruent to 24 mod 61.at n=27A142822