14083
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14084
- 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
- 14082
- Möbius Function
- -1
- Radical
- 14083
- 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
- 58
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1661
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(0) = 1, a(1) = 0, a(2) = -1; for n >= 3, a(n) = - a(n-2) + Sum_{ primes p with 3 <= p <= n} a(n-p).at n=60A002121
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=32A031830
- Numbers k such that 245*2^k+1 is prime.at n=24A032499
- Discriminants of imaginary quadratic fields with class number 17 (negated).at n=27A046014
- Prime number spiral (clockwise, West spoke).at n=20A054570
- Second term of weak prime quintets: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=32A054824
- Primes p such that 6p + 1 and (p-1)/6 are primes.at n=26A085957
- Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P_5.at n=41A091726
- Primes p such that there exist three primes q, r and s with p^3=q^3+r^3+s^3.at n=21A114923
- Prime numbers p such that p^3 - (p-1)^2 and p^3 + (p-1)^2 are also primes.at n=21A137474
- Prime chain of 128 terms, including 104 distinct primes, consisting of the output of eight equations that alternate sequentially within a procedural expression of a single polynomial. The equations are either subsequences of x^2 - 79x + 1601 or transforms with one exception: 100x^2 - 2260x + 12959. The other four distinct equations are Euler-derived: 25x^2 - 1185x + 14083, 25x^2 - 775x + 6047, 100x^2 - 2280x + 13159, 100x^2 - 4160x + 43427.at n=0A140708
- Primes of the form 210n + 13.at n=33A140841
- Primes congruent to 20 mod 41.at n=41A142217
- Primes congruent to 22 mod 43.at n=36A142271
- Primes congruent to 30 mod 47.at n=34A142381
- Primes congruent to 20 mod 49.at n=37A142431
- Primes congruent to 38 mod 53.at n=33A142568
- Primes congruent to 41 mod 59.at n=22A142768
- Primes congruent to 53 mod 61.at n=26A142851
- Primes p such that p^3-p^2-1 and p^3-p^2+1 are prime.at n=21A160858