14009
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14010
- 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
- 14008
- Möbius Function
- -1
- Radical
- 14009
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1653
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=43A005424
- Multiplicity of highest weight (or singular) vectors associated with character chi_130 of Monster module.at n=40A034518
- Maximal consecutive determinant of n X n persymmetric matrix with entries {-1,0,+1}.at n=9A034920
- First differences of A037260.at n=36A037261
- Smallest prime with "n^2" as central digit(s).at n=20A038370
- 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=32A059762
- Primes p such that 2*p+1 and ((2*p+1)^2 + 1)/2 = p^2 + (p+1)^2 are primes.at n=20A098717
- Primes of the form 47*k + 3.at n=36A100494
- Primes p such that 2p+1, 4p+3, 6p+5 are all primes.at n=14A107020
- Primes p such that p + 2 and p*(p + 2) + 2 are primes.at n=29A108013
- Smaller of two consecutive Sophie Germain primes with the same digital sum.at n=33A118506
- Primes of the form 1+2*n+3*n^2.at n=11A122430
- Primes congruent to 28 mod 41.at n=39A142225
- Primes congruent to 44 mod 49.at n=36A142451
- Primes congruent to 17 mod 53.at n=34A142547
- Primes congruent to 39 mod 55.at n=40A142629
- Primes congruent to 26 mod 59.at n=23A142753
- Primes congruent to 40 mod 61.at n=28A142838
- Primes of the form : 2*p+1=p1(prime), 2*p1+3=p2(prime), 2*p2+5=p3(prime).at n=28A143912
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 7: primes in A146332.at n=26A146352