13297
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13298
- 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
- 13296
- Möbius Function
- -1
- Radical
- 13297
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1579
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 10*3^k + 1 is prime.at n=21A005539
- sech(arcsin(arctan(x)))=1-1/2!*x^2+9/4!*x^4-249/6!*x^6+13297/8!*x^8...at n=4A012098
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=28A015994
- Fibonacci sequence beginning 4, 11.at n=16A022131
- a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=29A023109
- Primes that remain prime through 3 iterations of function f(x) = 2x + 3.at n=24A023273
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=37A031824
- Least number of Reverse-then-add persistence n.at n=29A033866
- Primes with multiplicative persistence value 5.at n=28A046505
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=17A064687
- Primes expressible as the sum of (at least two) consecutive primes in at least 3 ways.at n=22A067379
- Number of ordered triples (a, b, c) with gcd(a, b, c) = 1 and 1 <= {a, b, c} <= n.at n=24A071778
- Greatest number having exactly n representations as ab+ac+bc with 0 < a < b < c.at n=13A094377
- A variation on Flavius's sieve (A000960): Start with the primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=44A099207
- Number of partitions of 2*n into minimal numbers.at n=40A099385
- Smallest prime of the form k*prime(n+1)+prime(n) = j*prime(n+2)+prime(n+1) for free integer multipliers k and j.at n=13A129918
- Number of compositions of n such that the cardinality of the set of parts is 2.at n=19A131661
- Primes of the form x^2 + 1848*y^2.at n=36A139668
- Primes of the form 57x^2+18xy+193y^2.at n=25A140631
- Primes of the form 210k + 67.at n=32A140855