Properties of the Number -16255

Sixteen Thousand Two Hundred Fifty-Five

Basics

Value: -16256 → -16255 → -16254

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 3251

Divisors: 1, 5, 3251, 16255

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111101111111

Octal: -37577

Duodecimal: -94A7

Hexadecimal: -3f7f

Square: 264225025

Square Root: 127.49509794497983

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 such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts. A168659

Riordan array (1/(1+4x+x²), x/(1+4x+x²)). A159764

Centered 18-gonal numbers. A69131

Expansion of (-1 + ∏_k>=1 (1 + x^k)^k)⁵. A341387

Triangle of numbers related to the generalized Catalan sequence C(2;n+1)=A064062(n+1), n>=0. A113647

Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of·in increasing order). A207823

a(n) = ∑_d∣n (-1)^n/d+1*d⁷. A321552

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) is the number of ordered k-tuples (x₁, x₂, ..., x_k) with gcd(x₁, x₂, ..., x_k) = 1 (1 <= {x₁, x₂, ..., x_k} <= n). A344527

Sums of 3 distinct powers of 5. A38475

At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage. A56640