13360
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
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 17888
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5312
- Möbius Function
- 0
- Radical
- 1670
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = ceiling(exp((n-1)/2)).at n=20A005181
- arctanh(tan(arctanh(x))) = x + (6/3!)*x^3 + (184/5!)*x^5 + 13360/7!*x^7 + ...at n=3A012181
- Absolute differences between A109441 and A100948.at n=19A120722
- Antidiagonal sums of A147995 and A163545.at n=24A163484
- Number of binary sequences of length n having a conjugate at Hamming distance 2.at n=19A179674
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=33A245209
- Numbers k such that Bernoulli number B_{k} has denominator 230010.at n=3A295593
- Numbers k such that the largest prime divisor of k^4+1 is less than k.at n=14A309562
- Irregular table read by rows: Take a decagon with all diagonals drawn, as in A333139. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.at n=24A332417
- Triangle read by rows: T(n,k) is the number of partitions of a 4-colored set of n objects into exactly k parts with 0 <= k <= n.at n=51A382341