13931
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13932
- 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
- 13930
- Möbius Function
- -1
- Radical
- 13931
- 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
- 164
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1647
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Palindromic primes: prime numbers whose decimal expansion is a palindrome.at n=30A002385
- Number of ways in which n identical balls can be distributed among 5 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=17A005338
- Integer part of (4th elementary symmetric function of 3,4,...,n+5)/(3+4+...+n+5).at n=7A024192
- Greater of two consecutive palindromes, both of which are prime.at n=8A032594
- Palindromic Super-2 Numbers.at n=25A032750
- Palindromic primes that are "near miss circular primes" (all cyclic shifts except one are primes).at n=8A045978
- Largest palindromic substring in 8^n.at n=38A046266
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p1.at n=18A047976
- Palindromic primes containing no pair of consecutive equal digits.at n=26A050784
- Palindromic primes whose sum of squared digits is also prime.at n=13A052035
- Fifth term of weak prime quintets: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=31A054827
- Sixth term of weak prime sextet: p(m-4)-p(m-5) < p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=2A054833
- Palindromic primes with strictly increasing digits up to the middle and then strictly decreasing.at n=18A062351
- Nearest integer to log(n^n)^(1 + log(n)).at n=8A062478
- Primes p = prime(k) such that prime(k) + prime(k+5) = prime(k+1) + prime(k+4) = prime(k+2) + prime(k+3).at n=39A064101
- Primes formed by the concatenation 1, n, n^2, n, 1.at n=1A068676
- Let p = abc..k be a prime in base 10. Define mirror(p) = abc...k...cba. Sequence gives primes of the form mirror(p) for some p.at n=8A068686
- Numbers n such that phi(n) + sigma(n) = n + reversal(n).at n=31A069217
- Smallest palindromic prime with digit sum = n, or 0 if no such prime exists.at n=16A070245
- Palindromic primes with nonprime middle digit.at n=13A076613