14386
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21582
- Proper Divisor Sum (Aliquot Sum)
- 7196
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7192
- Möbius Function
- 1
- Radical
- 14386
- 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
- 164
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 61.at n=17A020400
- a(n) = 2*a(n-1) + (n-2)*a(n-2) with a(0) = 1, a(1) = 2.at n=9A027412
- Euler transform of reduced totient function psi(n), cf. A002322.at n=21A061257
- Expansion of (1-x)/(1-x+2*x^2).at n=32A078020
- Expansion of (1 + x)/(1 + x + 2x^2).at n=32A110512
- Sum of all parts of the last section of the set of partitions of n.at n=25A138879
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (0, 1, 1), (1, -1, 0)}.at n=9A148800
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=9A149233
- a(n) = 11^n - 4^n + 1^n.at n=4A155632
- Number of 7-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=18A186983
- Number A(n,k) of inequivalent n X k binary matrices, where equivalence means permutations of rows or columns or the symbol set; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=71A242093
- Number A(n,k) of inequivalent n X k binary matrices, where equivalence means permutations of rows or columns or the symbol set; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=72A242093
- Number of inequivalent n X 5 binary matrices, where equivalence means permutations of rows or columns or the symbol set.at n=6A246150
- Number of inequivalent n X 6 binary matrices, where equivalence means permutations of rows or columns or the symbol set.at n=5A246151
- Numbers k such that usigma(uphi(k)) = uphi(usigma(k)), where usigma is the sum of unitary divisors function (A034448) and uphi is the unitary totient function (A047994).at n=37A329730
- Number of length n inversion sequences avoiding the patterns 120 and 201.at n=8A374550
- G.f. A(x) satisfies A(x) = (1 + x) * B(x*A(x)), where B(x) is the g.f. of A001764.at n=6A381937