Properties of the Number -12856

Twelve Thousand Eight Hundred Fifty-Six

Basics

Value: -12857 → -12856 → -12855

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 1607

Divisors: 1, 2, 4, 8, 1607, 3214, 6428, 12856

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001000111000

Octal: -31070

Duodecimal: -7534

Hexadecimal: -3238

Square: 165276736

Square Root: 113.38430226446692

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 k, k+1, k+2 and k+3 have the same number of divisors. A6601

T(n,k)=Number of nXk 0..1 arrays with diagonals and antidiagonals unimodal and rows nondecreasing. A223949

Number of n-step three-sided prudent self-avoiding walks ending at the northwest corner of their box. A191828

Expansion of e.g.f. 1 / (6 - 5·exp(x))^4/5. A365570

Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 5. A209990

a(n) is the number of vertices formed by n-secting the angles of an octagon. A335770

a(n) = n*(7·n²-12·n+7)/2. A226451

Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m. A175356

Numbers n such that gcd(n, φ(n)) = gcd(φ(n), σ(n)) = gcd(σ(n), n) = τ(n). A217301

a(n) = ∑_i=1..n ∑_j=1..n ∑_k=1..n φ(i·j*k) / φ(j·k). A372663