13202
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 10990
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 1
- Radical
- 13202
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 76
- 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-1)*n*(n+4)/6.at n=42A005581
- Coordination sequence for sigma-CrFe, Position Xd.at n=29A009959
- Numbers k such that 153*2^k+1 is prime.at n=20A032453
- Starting from generation 7 add previous and next term yielding generation 8.at n=26A048454
- A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).at n=5A080299
- a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right.at n=44A080310
- Numbers n such that (6^n-1)^2-2 is prime.at n=16A100901
- a(n) = 2*n*(4*n-3).at n=41A139271
- a(n) = A014486(A154472(n)).at n=2A154473
- a(n) = 25*n^2 - n.at n=22A157514
- a(n) = 529*n^2 - 23.at n=4A158633
- Number of reduced words of length n in the Weyl group B_42.at n=3A162179
- Number of reduced words of length n in the Weyl group D_42.at n=3A162411
- a(n) = n! modulo n*(n+1)*(n+2)/3.at n=40A175624
- Number of strictly increasing arrangements of 4 nonzero numbers in -(n+2)..(n+2) with sum zero.at n=38A188123
- A014486-codes for the Beanstalk-tree growing one natural number at time, starting from the tree of one internal node (1), with the "lesser numbers to the left hand side" construction.at n=6A218776
- Least k such that the sum of the semiprime divisors equals n times the sum of the prime divisors, or 0 if no such k exists.at n=19A227419
- Number of length 1+3 0..n arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth.at n=9A249291
- G.f.: (1 + 5*x + 5*x^2 + x^3)/Product_{i=1..10} (1 - x^i).at n=25A256977
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 475", based on the 5-celled von Neumann neighborhood.at n=25A272449