Properties of the Number 14066

Fourteen Thousand Sixty-Six

Basics

Value: 14065 → 14066 → 14067

Parity: even

Prime: No

Previous Prime: 14057

Next Prime: 14071

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 13 × 541

Divisors: 1, 2, 13, 26, 541, 1082, 7033, 14066

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011011110010

Octal: 33362

Duodecimal: 8182

Hexadecimal: 36f2

Square: 197852356

Square Root: 118.6001686339442

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of partitions of n containing no part i of multiplicity i. A276429

Number of powerful rooted trees with n nodes. A317707

a(n) = 25·n² - 14·n + 2. A154357

Smallest k such that the simple continued fraction for Sum(d∣k, 1/d) contains exactly n elements. A71865

Expansion of ∏_k>=1 1/(1 - (5·k-3)*x^5·k-3). A265833

G.f. satisfies A(x) = exp( ∑_k>=1 (-1)^k+1 * (4 + A(x^k)) * x^k/k ). A363510

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ⁿ. A380518

Expansion of (1/x) * Series_Reversion( x / (1 + x³ * (1 + x)⁴) ). A389156

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. A293884

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. A377001