Properties of the Number -6712

Seven Hundred Twelve

Basics

Value: -6713 → -6712 → -6711

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 839

Divisors: 1, 2, 4, 8, 839, 1678, 3356, 6712

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1101000111000

Octal: -15070

Duodecimal: -3A74

Hexadecimal: -1a38

Square: 45050944

Square Root: 81.92679659305617

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

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock. A186881

Array read by antidiagonals: T(n,k) is the number of n-step king's tours on a k X k board summed over all starting positions. A186861

Number of diagonal rectangles with corners on an n X n grid of points. A113751

Number of 5-step king's tours on an n X n board summed over all starting positions. A186864

a(n) = PrimePi(n³) - PrimePi(n) * PrimePi(n²), where PrimePi = A000720. A291539

Number of cyclic compositions of n into parts >= 2. A32190

Numbers k such that k*(k+5) gives the concatenation of two numbers m and m-4. A116261

a(n) = 839·n. A135639

Triangle read by rows: T(n,k) is the sum of the lengths of the free polyominoes with n cells and length k, n >= 1, k >= 1. A379638

a(n) = a(n-1) + 10·a(n-2) for n >= 2, a(0)=1, a(1)=2. A133577