13686
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27384
- Proper Divisor Sum (Aliquot Sum)
- 13698
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4560
- Möbius Function
- -1
- Radical
- 13686
- Omega Function (Ω)
- 3
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.at n=34A056520
- Centered 23-gonal numbers.at n=34A069174
- Numbers k such that k+1, k^2+1 and k^4+1 are primes.at n=33A070325
- Solve 2^n - 2 = 7(x^2 - x) + (y^2 - y) for (x,y) with x>0, y>0; sequence gives value of x.at n=33A076632
- Expansion of (1-x)^(-1)/(1-x+2*x^2).at n=31A077876
- Indices of prime hexanacci (or Fibonacci 6-step) numbers A001592 (using offset -4).at n=8A105758
- a(n) = 9*n^2 - 3.at n=38A157872
- Right edge of triangular table A138612.at n=32A166019
- Number of arrangements of n+2 numbers in 0..3 with each number being the sum mod 4 of two others.at n=4A183878
- T(n,k)=Number of arrangements of n+2 numbers in 0..k with each number being the sum mod (k+1) of two others.at n=25A183884
- Number of n-step four-sided prudent self-avoiding walks ending at the northwest corner of their box.at n=11A191758
- Table of the elementary symmetric functions a_k(1,2,3,5,6...n+1) (missing 4).at n=48A196843
- The number of subsets of the numbers {1,2,3...,n} consisting of at most 3 elements and at most two of those are even.at n=45A204555
- Expansion of 1/((1-x)^2*(1-x^2)^3*(1-x^3)^2*(1-x^4)).at n=21A210068
- G.f. for Ehrhart quasi-polynomials for hyperplane arrangements of type E_7.at n=39A210633
- Number of segments needed to draw (on the infinite square grid) a diagram of regions and partitions of n.at n=30A211026
- Number of n X n 0..6 matrices with each 2X2 subblock idempotent.at n=9A224663
- Number of arrays of median of three adjacent elements of some length-5 0..n array, with no adjacent equal elements in the latter.at n=22A229013
- Fixed points of permutations A275837 & A275838.at n=22A275839
- Number of multiset partitions of normal multisets of size n such that the blocks have empty intersection.at n=6A317752