13319
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 721
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12600
- Möbius Function
- 1
- Radical
- 13319
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 169
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- arctanh(sec(x)*arctanh(x))=x+7/3!*x^3+193/5!*x^5+13319/7!*x^7...at n=3A012849
- Expansion of e.g.f.: log(arctanh(x)+cos(x)) = x-2/2!*x^2+7/3!*x^3-28/4!*x^4+193/5!*x^5...at n=7A013181
- Numbers whose base-7 representation contains exactly four 5's.at n=8A043416
- Composite k such that (k+1) * Sum_{d|k} d/sigma(d) is an integer.at n=12A068975
- Multiples of 19 containing a 19 in their decimal representation.at n=25A121039
- Numbers n such that 2*41^n + 1 is prime.at n=5A143252
- G.f. A(x) satisfies A(x) = 1 + Sum_{n>=1} A(x)^n * x^n/(1 - x^n)^n.at n=9A194690
- Number of 0..n arrays of length 3 with each element differing from at least one neighbor by something other than 1.at n=23A221574
- Number of nX5 0..2 arrays with exactly floor(nX5/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=4A223031
- T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=40A223033
- Numbers k such that 11*12^k + 1 is prime.at n=7A251259
- Numbers n such that 1+16n^2, 1+16(n+1)^2 and 1+16(n+2)^2 are prime.at n=41A255635
- Construct a hollow square of 1's of side n and fill its interior with 0's to create a stack of n binary numbers. Express the sum of the stack in decimal.at n=10A269059
- Sum of the largest parts of the partitions of n into 8 squarefree parts.at n=43A326452
- Odd composite integers m such that A052918(m-J(m,29)) == 0 (mod m) and gcd(m,29)=1, where J(m,29) is the Jacobi symbol.at n=18A340095