14249
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14250
- 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
- 14248
- Möbius Function
- -1
- Radical
- 14249
- 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
- 102
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1674
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of compositions of n into a sum of odd primes.at n=43A002124
- 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=33A059762
- Numbers k such that 2^k - F(k) is prime, where F(n) is the n-th Fibonacci number.at n=16A074716
- Average of terms of n-th row of A077321.at n=40A077325
- Smallest prime p such that (2n)*p +1 and (p-1)/(2n) are prime, or 0 if no such prime exists.at n=51A085956
- a(n) = A085956(3n+1).at n=17A086362
- Smallest member of a pair of consecutive twin prime pairs that have three primes between them.at n=19A089635
- Primes p such that 2*p+1 and ((2*p+1)^2 + 1)/2 = p^2 + (p+1)^2 are primes.at n=21A098717
- Numbers n such that 2*10^n + 8*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=10A102962
- Primes p = prime(k) such that both p+2 and prime(k+6)-2 are prime numbers.at n=34A105413
- Number of permutations of length n which avoid the patterns 1234, 1432, 3214.at n=9A116811
- Larger of two consecutive Sophie Germain primes with the same digital sum.at n=35A118507
- Primes congruent to 16 mod 43.at n=37A142265
- Primes congruent to 8 mod 47.at n=37A142359
- Primes congruent to 45 mod 53.at n=32A142575
- Primes congruent to 30 mod 59.at n=28A142757
- Primes congruent to 36 mod 61.at n=27A142834
- Primes in A152535.at n=20A152563
- Primes p such that p-1 and p+1 each contain at least one cubed prime in their prime factorization.at n=19A162870
- a(n) = 20*a(n-1)-93*a(n-2) for n > 1; a(0) = 1, a(1) = 10.at n=4A163192