Properties of the Number -14255

Fourteen Thousand Two Hundred Fifty-Five

Basics

Value: -14256 → -14255 → -14254

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 2851

Divisors: 1, 5, 2851, 14255

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11011110101111

Octal: -33657

Duodecimal: -82BB

Hexadecimal: -37af

Square: 203205025

Square Root: 119.39430472179149

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 planar partitions of n with all part sizes distinct. A117433

a(n) = ∑_k=1..n (-1)^k+1 * floor(n/k)³. A344721

a(n) = floor(e^n/e). A61481

a(n) = 44·n² - 1. A158628

Number of binary strings of length n with equal numbers of 0001 and 0100 substrings. A164157

a(n) = 11·6ⁿ - 1. A198848

Number of nX2 0..4 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A200984

a(n) = (3ⁿ⁺¹-2ⁿ⁺²+2·n+1)/4. A263622

Expansion of ∏_k>=2 1/(1 - x^k)^p(k), where p(k) = number of partitions of k (A000041). A317911

Minimal voucher cost for n distinct positive integer vouchers v₁, v₂, ..., v_n, where the cost is defined as v₁ + v₁*v₂ + v₂*v₃ + ... + v_n-1*v_n. A393145