Properties of the Number -526256

Five Hundred Twenty-Six Thousand Two Hundred Fifty-Six

Basics

Value: -526257 → -526256 → -526255

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 31 × 1061

Divisors: 1, 2, 4, 8, 16, 31, 62, 124, 248, 496

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000000011110110000

Octal: -2003660

Duodecimal: -214668

Hexadecimal: -807b0

Square: 276945377536

Square Root: 725.4350418886587

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

a(n) is the number of possible choices for the first n terms of a "mean-central" sequence, where a monotonically increasing sequence of positive integers {b(n)} is called "mean-central" if for each positive integer k, the arithmetic mean of the first b(k) terms is exactly b(k). A383192

If H(0,n) = 1/n, H(m,n) = sum{k=1...n} H(m-1,k), then a(n) = (2n)!*H(n,2n)/(4n-1). A114449

Number of binary Lyndon words of length n having a conjugate at Hamming distance 2. A226893

Square array read by antidiagonals: T(m,n) = H(n,2·m)*(2·m)!/(2·m+2·n-1). H(0,m) = 1/m, for all positive integers m. H(n,m) = ∑_k=1..m H(n-1,k). A136205