17213
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19680
- Proper Divisor Sum (Aliquot Sum)
- 2467
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14748
- Möbius Function
- 1
- Radical
- 17213
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 110
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of asymmetric types of (3,n)-hypergraphs without isolated nodes, under action of symmetric group S_3; asymmetric n-covers of an unlabeled 3-set.at n=11A055538
- Number of Pierpont primes less than 10^(2^n).at n=11A113412
- Related to numbers of equicolorable trees (see Pippenger article for definition).at n=14A119853
- Number of nXnXn triangular 0..2 arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=5A214534
- T(n,k)=Number of nXnXn triangular 0..k arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=26A214540
- Number of 6X6X6 triangular 0..n arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=1A214544
- Number of Schroeder paths of semilength n in which there are no (2,0)-steps at level 1.at n=8A224071
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 478", based on the 5-celled von Neumann neighborhood.at n=33A272453
- Expansion of 1 / (1 - Sum_{i>=1, j>=1} x^(i*(j + 1))).at n=20A327798
- Sum of the products of pairs of Padovan numbers which are two apart, starting from A000931(5).at n=16A329178
- Number of strict compositions of n with all adjacent parts (x, y) satisfying x <= 2y and y <= 2x.at n=47A342342