Properties of the Number 14115

Fourteen Thousand One Hundred Fifteen

Basics

Value: 14114 → 14115 → 14116

Parity: odd

Prime: No

Previous Prime: 14107

Next Prime: 14143

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 941

Divisors: 1, 3, 5, 15, 941, 2823, 4705, 14115

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11011100100011

Octal: 33443

Duodecimal: 8203

Hexadecimal: 3723

Square: 199233225

Square Root: 118.80656547514535

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

Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers. A169822

Number of n-step three-sided prudent self-avoiding walks ending on the top side of their box. A191824

a(0) = 1; a(n) = ∑_{k=0..floor((n-1)/2)} (-4)^k * a(k) * a(n-2·k-1). A352011

a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such integer exists. A360217

Numbers whose set of base-8 digits is {3,4}. A32832

Number of partitions of n into distinct parts where there are k²-1 kinds of part k. A363599

Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 39. A31537

Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-1111-1000 pattern in any orientation. A146715

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (1, -1, 1), (1, 0, -1), (1, 1, 1)}. A150872

Self-composition of the pentagonal numbers; g.f.: A(x) = G(G(x)), where G(x) = g.f. of A000326. A279284