13259
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13260
- 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
- 13258
- Möbius Function
- -1
- Radical
- 13259
- 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
- 1576
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=34A023285
- Palindromic primes in base 8.at n=31A029976
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=25A031826
- Base 8 palindromes that start with 3.at n=33A043023
- Primes p such that there is no Carmichael number pqr, p<q<r q, r primes.at n=14A051663
- Primes p whose period of reciprocal equals (p-1)/7.at n=12A056212
- Primes p such that p^9 reversed is also prime.at n=37A059702
- Number of symmetric sum-free subsets of {1,2,...,n-1} with sums taken mod n.at n=45A083041
- Primes arising in A086498: a(n) = (2n)-th partial sum of A086498.at n=37A086499
- Duplicate of A056212.at n=12A098674
- Primes of the form 47n+5.at n=35A100760
- Number of base 31 circular n-digit numbers with adjacent digits differing by 4 or less.at n=4A125368
- Primes of the form 210k + 29.at n=34A140845
- Primes congruent to 16 mod 41.at n=34A142213
- Primes congruent to 15 mod 43.at n=35A142264
- Primes congruent to 29 mod 49.at n=39A142438
- Primes congruent to 9 mod 53.at n=33A142539
- Primes congruent to 43 mod 59.at n=27A142770
- Primes congruent to 22 mod 61.at n=28A142820
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=9A148787