13602
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 13614
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4532
- Möbius Function
- -1
- Radical
- 13602
- 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
- 89
- 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
- Number of primitive n-bead necklaces (turning over is allowed) where complements are equivalent.at n=20A000046
- Expansion of g.f. Product_{k >= 1} (1 - x^k)^(-k*(k+1)/2).at n=12A000294
- Number of corners, or planar partitions of n with only one row and one column.at n=20A006330
- Numerators of continued fraction convergents to sqrt(605).at n=6A042160
- Number of primitive (period n) bracelet structures using exactly two different colored beads.at n=19A056366
- Ulam's spiral (SSW spoke).at n=29A143838
- G.f. A(x) satisfies: d/dx x*A(x) = 1+x + x*[d/dx log(A(x))].at n=7A158884
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps of weight 2. These are paths that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1; an (1,0)-step with weight 2; a (1,1)-step with weight 2; a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=50A182885
- Riordan matrix ((1-x-x^2)/(1-2x-x^2),(x-x^2-x^3)/(1-2x-x^2)).at n=69A190215
- G.f.: Sum_{n=-oo..+oo} x^n * (1 + x^n)^n, an even function.at n=51A260361
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 734", based on the 5-celled von Neumann neighborhood.at n=29A273455
- Number of nX3 0..1 arrays with each 1 adjacent to 3 or 5 king-move neighboring 1s.at n=12A296152
- Number of integer partitions of n in which the even parts appear as often at even positions as at odd positions.at n=40A300787
- G.f.: Sum_{k>=1} x^k/(1-x^k) * Product_{k>=1} (1+x^k)/(1-x^k).at n=17A305102
- Expansion of the o.g.f. (2*x^2 + 3*x + 2)*x/((x + 1)^2*(x - 1)^4).at n=35A342397
- Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median.at n=37A363740