Properties of the Number 13866

Thirteen Thousand Eight Hundred Sixty-Six

Basics

Value: 13865 → 13866 → 13867

Parity: even

Prime: No

Previous Prime: 13859

Next Prime: 13873

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 2311

Divisors: 1, 2, 3, 6, 2311, 4622, 6933, 13866

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011000101010

Octal: 33052

Duodecimal: 8036

Hexadecimal: 362a

Square: 192265956

Square Root: 117.75398082442904

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 integer partitions of n such that either the run-lengths or the negated run-lengths are unimodal. A332746

Seventh column of triangle A055249. A55250

Consider the trajectory of n under the iteration of a map which sends·to 3x - σ(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0. A37159

Numbers such that the sum of the factorials of the digits of the fourth power is a square. A126077

a(0) = a(1) = 1. a(n) = a(n-1) + a(n - b(n)), where b(n) is smallest prime dividing n. A137808

Number of 7 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally. A188558

E.g.f. satisfies: A(x) = 1 + Integral A(x) + A(x)²*log(A(x)) dx. A249833

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood. A271150

Array read by downward antidiagonals: A(n,k) = A(n-1,k+1) + (k+1)*∑_j=0..k binomial(k, j)*A(n-1,j) with A(0,k) = 1, n >= 0, k >= 0. A370382

Triangle read by rows: number of forests of (k+1) ordered trees with 2(n-k) edges having root of even degree and nonroot nodes of outdegree 0 or 2. A307214