13163
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13164
- 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
- 13162
- Möbius Function
- -1
- Radical
- 13163
- 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
- 138
- 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
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1566
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- T(n, 2*n-3), T given by A027960.at n=40A027965
- a(n) is smallest safe prime (A005385) such that a(n) + 12*n is the next safe prime, i.e., x = (a(n) - 1)/2 and x + 6*n are closest Sophie Germain primes.at n=29A059327
- a(n) = (n^3 + 6n^2 - n + 12)/6.at n=41A074742
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 6*p+1 is also prime.at n=42A075705
- Class 6- primes (for definition see A005109).at n=37A081425
- Members of A083989 whose 10's complement is also a member of A083989.at n=21A083991
- Primes of the form 47*k + 3.at n=34A100494
- a(n) = 1 + 2 * least i such that A103507(i)=n+1, 0 if no such i exists.at n=31A103508
- Numbers k such that the k-th triangular number contains only digits {3,6,8}.at n=7A119197
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 8.at n=24A119595
- Primes p such that |100-p|, |1000-p|, |10000-p| and |100000-p| are also primes.at n=20A126021
- a(1)=2, a(2)=3; a(n)=a(n-2)+s^2, where s^2 is a minimal square such that a(n) is prime and is not already in the sequence.at n=41A127494
- Primes congruent to 28 mod 37.at n=37A142137
- Primes congruent to 2 mod 41.at n=40A142199
- Primes congruent to 5 mod 43.at n=36A142254
- Primes congruent to 31 mod 49.at n=40A142440
- Primes congruent to 19 mod 53.at n=34A142549
- Primes congruent to 18 mod 55.at n=39A142614
- Primes congruent to 6 mod 59.at n=25A142733
- Primes congruent to 48 mod 61.at n=26A142846