13704
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 34320
- Proper Divisor Sum (Aliquot Sum)
- 20616
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4560
- Möbius Function
- 0
- Radical
- 3426
- Omega Function (Ω)
- 5
- 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
- 32
- 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
- Aliquot sequence starting at 552.at n=7A014360
- Number of ordered quadruples of integers from [ 1..n ] with no global factor.at n=22A015634
- Numbers k such that rotating digits of k^2 left once still yields a square.at n=16A045878
- Number of non-unimodal compositions of n into distinct terms.at n=27A072707
- Triangle read by rows: T(n,k) is the number of Dyck n-paths with k large components, 0 <= k <= n/2.at n=53A097877
- Number of 5 X 5 X 5 triangular nonnegative integer arrays, symmetric under 120 degree rotation, with all sums of an element and its neighbors <= n.at n=18A166213
- Expansion of 1/(1 - x - x^6 - x^11 + x^12).at n=40A175773
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>=2n.at n=24A211645
- Number of 0..2 arrays of length n with no adjacent pair equal to its immediately preceding adjacent pair, and new values introduced in 0..2 order.at n=10A212823
- Values of n such that n^2 + (n-d)^2 is prime for a record first value of d.at n=17A239390
- Least number k such that (n!+k)/n and (n!-k)/n are both prime.at n=21A245697
- Palindromic in bases 7 and 29.at n=18A249158
- Number of (n+2) X (2+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000011.at n=5A259888
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000011.at n=1A259892
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000011.at n=22A259894
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000011.at n=26A259894
- Number of (n+1) X (1+1) arrays of permutations of 0..n*2+1 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order.at n=4A263503
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order.at n=14A263506
- Nonprime numbers k such that the sum of the divisors of k^2 is of the form m^2 + m + 1.at n=28A289385
- a(n) = Sum_{k=1..n} k * A088370(n,k).at n=37A309371