17842
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29232
- Proper Divisor Sum (Aliquot Sum)
- 11390
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8100
- Möbius Function
- -1
- Radical
- 17842
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 141
- 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) = floor ( n(n+1)(n+2)(n+3) / (n+(n+1)+(n+2)+(n+3)) ).at n=40A032767
- Sum of the heights of all left factors of Dyck paths of length n.at n=13A132891
- Number of binary strings of length n with equal numbers of 00010 and 01100 substrings.at n=15A164218
- Number of line segments connecting exactly 10 points in an n x n grid of points.at n=45A177726
- Numbers k such that sigma(k - 2) = sigma(k + 2).at n=22A223091
- Number of partitions p of n such that (maximal multiplicity of the parts of p) <= (maximal part of p).at n=37A240311
- G.f. A(x) = Sum_{n=-oo..+oo} x^n * (1 + x^n)^(2*n).at n=60A260147
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 214", based on the 5-celled von Neumann neighborhood.at n=36A270907
- Number of 7 X n 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=14A301796
- Dirichlet self-convolution of the integer partition numbers A000041.at n=32A323764
- Number of ordered pairs of disjoint strict integer partitions of n.at n=29A365662
- Number of integer partitions of n having no permutation with all equal run-sums.at n=36A383096
- a(n) = 25*n^2/2 - 11*n/2 + 1.at n=38A383465