13291
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13292
- 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
- 13290
- Möbius Function
- -1
- Radical
- 13291
- 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
- 76
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1578
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=26A007996
- Primes that remain prime through 3 iterations of function f(x) = 5x + 2.at n=18A023283
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=34A031828
- Discriminants of imaginary quadratic fields with class number 21 (negated).at n=38A046018
- Primes of the form 30*p + 1 where p is also prime.at n=32A051646
- a(1)=2; a(n) for n>1 is the smallest prime number > a(n-1) such that the concatenation of all previous terms is also prime.at n=27A080155
- Primes arising as A093929(n)*A093929(n+1)+2.at n=36A093930
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=22A094933
- Row sums of triangle A111536.at n=6A111539
- Primes p such that p - q = 24, where q is the previous prime before p; or prime numbers preceded by precisely 23 composite numbers.at n=21A126720
- Primes of the form 210k + 61.at n=33A140854
- Primes congruent to 8 mod 37.at n=39A142117
- Primes congruent to 7 mod 41.at n=40A142204
- Primes congruent to 4 mod 43.at n=36A142253
- Primes congruent to 37 mod 47.at n=35A142388
- Primes congruent to 12 mod 49.at n=32A142424
- Primes congruent to 41 mod 53.at n=30A142571
- Primes congruent to 36 mod 55.at n=36A142626
- Primes congruent to 16 mod 59.at n=25A142743
- Primes congruent to 54 mod 61.at n=25A142852