13049
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13050
- 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
- 13048
- Möbius Function
- -1
- Radical
- 13049
- 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
- 200
- 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
- 1555
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of x/(1 - 3*x - 11*x^2).at n=7A015529
- Diagonal sum of right-justified array T given by A027023.at n=12A027038
- Engel expansion of log(10) = 2.30259...at n=14A059182
- Primes such that successive differences are distinct palindromes.at n=37A087582
- Primes of the form F(k)*F(k+1) + F(k+2).at n=8A094810
- Primes of the form a^4 + b^3 with b>0.at n=27A100271
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 14.at n=18A118380
- Smaller of two consecutive Sophie Germain primes with the same digital sum.at n=31A118506
- Primes p that divide Fibonacci[(p-1)/7].at n=17A125253
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=17A127028
- Primes q such that p = (r+q+s-1)/2 is a balanced prime, where r, q, s are consecutive primes.at n=6A129190
- Cyclops primes.at n=35A134809
- List of triples of strictly non-palindromic primes without an ordinary prime in between.at n=15A138358
- a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + Sum_{j=1..2^m} a(j).at n=47A139485
- a(1)=1, a(n)=a(n-1)+n^3 if n odd, a(n)=a(n-1)+ n^0 if n is even.at n=16A140152
- Primes of the form 210k + 29.at n=33A140845
- Primes congruent to 11 mod 41.at n=37A142208
- Primes congruent to 20 mod 43.at n=39A142269
- Primes congruent to 30 mod 47.at n=31A142381
- Primes congruent to 15 mod 49.at n=36A142426