14217
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21696
- Proper Divisor Sum (Aliquot Sum)
- 7479
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8112
- Möbius Function
- -1
- Radical
- 14217
- 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
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- Number of homeomorphically irreducible general graphs on 3 labeled node and with n edges.at n=15A060578
- a(n+1)=a(n)+a(n-1) if a(n-1) odd, a(n+1)=a(n)+a(n-1)/2 if a(n-1) even.at n=23A078696
- Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=13A098241
- Where A007535 reaches a record.at n=33A098653
- Number of n-element unlabeled N-free posets.at n=8A202182
- a(n) = Sum_{y=1..n} Sum_{x=1..n} floor((x^k + y^k)^(1/k)) with k = 3.at n=26A211792
- Write the coefficient of x^n/n! in the expansion of (x/(exp(x)-1))^(1/2) as f(n)/g(n); sequence gives f(n).at n=10A241885
- Number of (2+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=21A250757
- Square array A(m,n) = number whose binary expansion is the concatenation of those of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=33A285806
- Array read by antidiagonals: T(m,n) = number of irredundant sets in the m X n king graph.at n=39A286870
- Array read by antidiagonals: T(m,n) = number of irredundant sets in the m X n king graph.at n=41A286870
- Numbers k such that 2^(k-1) - k is prime.at n=12A296031
- T(n, k) = numerator([x^n] N(1/2, n, x)) where N(a, n, x) is the n-th Nørlund polynomial.at n=55A370414
- Numbers k that divide the k-th central Delannoy number.at n=27A372901