Properties of the Number -14310

Fourteen Thousand Three Hundred Ten

Basics

Value: -14311 → -14310 → -14309

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 5 × 53

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 27

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11011111100110

Octal: -33746

Duodecimal: -8346

Hexadecimal: -37e6

Square: 204776100

Square Root: 119.62441222426132

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

Expansion of ∏_k>=1 (1/(1 + 3·x^k))^k. A261567

Number of necklaces with n beads of 2 colors, allowing turning over (these are also called bracelets). A29

a(n) = ∑_j=0..n ∑_k=0..j A026615(j, k). A26624

Number of partitions of n into parts not of forms 4·k+2, 20·k, 10·k+5. A36026

Expansion of f(q) * f(q⁵) / φ(-q²)² in powers of q where f(), φ() are Ramanujan θ functions. A145722

Expansion of (1/(1 - x)) * ∑_k>=0 x^2·k+1 / ∏_j=1..2·k+1 (1 - x^j). A306145

Array read by antidiagonals: T(n,k) is the number of unlabeled oriented k-gonal 2-trees with n oriented polygons, n >= 0, k >= 2. A340812

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood. A286413

Sum of ceiling(n/per(w)) over all binary words of length n. A331699

Numbers n such that n | sigma₁₃(n). A55717