14066
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22764
- Proper Divisor Sum (Aliquot Sum)
- 8698
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- -1
- Radical
- 14066
- 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
- 107
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_109 of Monster module.at n=41A034497
- Smallest k such that the simple continued fraction for Sum(d|k, 1/d) contains exactly n elements.at n=15A071865
- 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), (-1, 0, 0), (0, 0, -1), (1, 1, 1)}.at n=9A149232
- a(n) = 25*n^2 - 14*n + 2.at n=24A154357
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = x + 1/2.at n=45A231730
- Expansion of Product_{k>=1} 1/(1 - (5*k-3)*x^(5*k-3)).at n=26A265833
- Number of partitions of n containing no part i of multiplicity i.at n=37A276429
- Number of (undirected) Hamiltonian paths in the n-Fibonacci cube graph.at n=5A289998
- Number of sets of nonempty words with a total of n letters over ternary alphabet containing the third letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=8A293884
- Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k.at n=28A297526
- Number of powerful rooted trees with n nodes.at n=28A317707
- G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)^(k+1) * (4 + A(x^k)) * x^k/k ).at n=7A363510
- Integers k equal to the sum over A000203(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation.at n=30A377001
- Irregular triangle read by rows: T(n,k) is the number of non-isomorphic formulas in conjunctive normal form (CNF) with n variables and k distinct clauses up to permutations of the variables and clauses, 0 <= k <= 3^n.at n=21A380518
- Irregular triangle read by rows: T(n,k) is the number of non-isomorphic formulas in conjunctive normal form (CNF) with n variables and k distinct clauses up to permutations of the variables and clauses, 0 <= k <= 3^n.at n=38A380518
- Expansion of (1/x) * Series_Reversion( x / (1 + x^3 * (1 + x)^4) ).at n=13A389156