14669
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14670
- 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
- 14668
- Möbius Function
- -1
- Radical
- 14669
- 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
- 45
- 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
- 1718
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = Sum_{k=0..n} (k+1) * T(n, k), with T given by A026300.at n=8A026943
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5).at n=37A039870
- 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=34A054825
- Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.at n=35A059762
- Numbers k such that 64^k - 63^k is prime.at n=6A062630
- a(n) = A064837(n)/2.at n=10A064838
- Smallest prime divisor of (n-th primorial - (n+1)-st prime).at n=14A065314
- Primes from merging of 5 successive digits in decimal expansion of the Euler-Mascheroni Constant.at n=32A104939
- Primes p such that 2p+1, 4p+3, 6p+5 are all primes.at n=16A107020
- Larger prime in pair prime(k) +/- k for some k.at n=22A107637
- Riordan array (1/(1-x*c(3*x)), x*c(3*x)/(1-x*c(3*x))), c(x) the g.f. of A000108.at n=31A110519
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 14.at n=25A118380
- Mother primes of order 9.at n=40A136068
- Primes congruent to 18 mod 49.at n=36A142429
- Primes congruent to 41 mod 53.at n=34A142571
- Primes congruent to 20 mod 57.at n=41A142677
- Primes congruent to 37 mod 59.at n=32A142764
- Primes congruent to 29 mod 61.at n=34A142827
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}.at n=10A148158
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 0), (0, 1, -1), (1, 1, 1)}.at n=8A149591