14639
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14640
- 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
- 14638
- Möbius Function
- -1
- Radical
- 14639
- 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
- 151
- 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
- 1715
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Oscillates under partition transform.at n=50A007211
- a(n) = Sum_{k=floor((n+1)/2)..n} T(k,n-k); i.e., a(n) is n-th diagonal sum of left-justified array T given by A027011.at n=22A027022
- Primes of the form k^2 - 2.at n=30A028871
- Primes which when converted to base 36 make single letters or English words.at n=44A038842
- Last member of a sexy prime quadruple: value of p+18 such that p, p+6, p+12 and p+18 are all prime.at n=28A046124
- Primes p of form q^k-2 where q is also a prime and k > 1.at n=20A053705
- 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=33A054826
- a(n) = a(n-1) + the number of primes <= a(n-1).at n=44A061535
- Smallest prime p such that n is a solution mod p of x^4 = 2, or 0 if no such prime exists.at n=9A065902
- Total number of right truncatable primes in base n.at n=28A076586
- a(n) = 82n^3 - 1228n^2 + 6130n - 5861.at n=10A076808
- a(n) = smallest prime of the form (2n-1)^k - 2, or 0 if no such number exists.at n=5A084714
- Primes that are 2 less than a perfect power m^k, k >= 2.at n=33A094786
- Primes of the form m^k-k, with m and k > 1.at n=40A099228
- Largest prime <= 11^n.at n=3A104096
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 14.at n=24A118380
- a(n) = 11^n - 2.at n=3A130652
- Least prime P such that P^(2*prime(n))-P^prime(n)-1 is prime with prime(n) the n-th prime.at n=35A131580
- Primes of the form 11^k - 2.at n=0A133858
- Primes congruent to 22 mod 47.at n=39A142373