Properties of the Number -6714

Seven Hundred Fourteen

Basics

Value: -6715 → -6714 → -6713

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 373

Divisors: 1, 2, 3, 6, 9, 18, 373, 746, 1119, 2238

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101000111010

Octal: -15072

Duodecimal: -3A76

Hexadecimal: -1a3a

Square: 45077796

Square Root: 81.93900170248598

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) = ∑_k=1..n (-1)^k-1 * binomial(k+2,3) * floor(n/k). A366938

Sum of the n-th powers of the roots of the polynomial x⁶ + 14x⁵ + 87x⁴ + 148x³ + 87x² + 14x + 1. A123228

Expansion of g.f. (1-x²)/(1-x-2·x²+x³). A28495

Euler transform of reduced totient function ψ(n), cf. A002322. A61257

Expansion of (1-2·x)*(1-x)/(1-5·x+6·x²-x³). A52975

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A50028

Floor[X/Y] where X = concatenation of (n+1)-st odd number through the 2n-th odd number and Y = concatenation of first n odd numbers. A67093

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 2. A50044

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 2. A50060

a(n) = ∑_k=0..n binomial(k+2,2) * binomial(2·k,2·n-2·k). A382230