13913
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13914
- 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
- 13912
- Möbius Function
- -1
- Radical
- 13913
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1645
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 95.at n=11A020434
- 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=31A054825
- 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=30A054826
- Fourth term of weak prime sextet: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=2A054831
- Primes p such that x^47 = 2 has no solution mod p.at n=37A059257
- a(n) = p.q in decimal notation where p = prime(n) and q is the smallest prime (A066065(n)) such that the concatenation p.q is a prime.at n=33A066064
- Prime(n) and prime(n+2) use the same digits.at n=21A069794
- Primes with at least four digits such that sum of any three_neighbor_digits is prime; first and last digits are neighbors.at n=37A086259
- a(n) = n^3 + prime(n).at n=23A089620
- Primes of the form n^2 - 11.at n=16A091272
- Primes p such that p's set of distinct digits is {1,3,9}.at n=27A108383
- Primes of the form 210k + 53.at n=31A140851
- Primes congruent to 24 mod 43.at n=37A142273
- Primes congruent to 46 mod 49.at n=36A142453
- Primes congruent to 27 mod 53.at n=29A142557
- Primes congruent to 48 mod 59.at n=30A142775
- Primes congruent to 5 mod 61.at n=24A142803
- Numbers n with property that n^2 is a concatenation of three 3-digit primes.at n=14A153139
- Primes of the form XYX, where Y is a single digit.at n=20A154270
- Primes of the form 10n^2+6n+1.at n=15A154409