13441
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13442
- 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
- 13440
- Möbius Function
- -1
- Radical
- 13441
- 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
- 89
- 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
- 1593
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Fibonacci sequence beginning 1, 13.at n=16A022103
- Convolution of Lucas numbers and (F(2), F(3), F(4), ...).at n=13A023619
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 78 ones.at n=8A031846
- Upper prime of a difference of 20 between consecutive primes.at n=27A031939
- Primes which when converted to base 36 make single letters or English words.at n=39A038842
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=28A059287
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.at n=33A070184
- Primes of the form 210n + 1.at n=30A073102
- Primes arising in A073697.at n=3A073695
- Number of symmetric sum-free subsets of {1,2,...,n-1} with sums taken mod n.at n=50A083041
- Primes of the form (k! + 3)/3.at n=3A089131
- Primes p such that tau(p-1)+tau(p+1) is larger than for any previous term. (Smallest prime sandwiched between more composite numbers.)at n=25A090481
- Smallest prime of the form n!/k + 1. k < = n, or 0 if no such prime exists.at n=7A092970
- Number of partitions of 2*n into distinct parts with exactly two odd parts.at n=34A096914
- A Chebyshev transform of A099456 associated to the knot 9_44.at n=12A099457
- Lesser of a,b where n^2 = a^3 + b^3; a,b > 0 and gcd(a,b)=1. The greater of a,b is the corresponding term in A099533 and n, which is used to order this sequence, is the corresponding term in A099426.at n=38A099532
- Smallest odd prime p such that n=(p-1)/ord_p(3).at n=39A101209
- Primes p such that the largest prime factor of p^5 + 1 is less than p.at n=4A102327
- Primes of the form 256n+129.at n=14A105130
- Lesser prime in pair prime(k) +/- k for some k.at n=25A107636