Properties of the Number -6702

Seven Hundred Two

Basics

Value: -6703 → -6702 → -6701

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 1117

Divisors: 1, 2, 3, 6, 1117, 2234, 3351, 6702

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101000101110

Octal: -15056

Duodecimal: -3A66

Hexadecimal: -1a2e

Square: 44916804

Square Root: 81.8657437515839

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 greatest k such that A307730(k) = n. A348409

Number of integer partitions of n with some part that can be written as a nonnegative linear combination of the other distinct parts. A365068

Consider the Diophantine equation x³ + y³ = z³ - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y. A50789

At these values of k the first, 2nd and 3rd cyclotomic polynomials all give prime numbers. A70020

A triangle related to the GF(z) formulas of the rows of the ED4 array A167584. A167594

Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed. A228963

Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n²-1, in increasing order. A256407

Numbers k such that 33·2^k - 1 is prime. A2240

Number of returns to the x-axis (i.e., d or u steps hitting the x-axis) in all Grand Motzkin paths of length n. (A Grand Motzkin path of length n is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).). A109194

Triangle read by rows: T(n,k) = number of unlabeled bicolored graphs with no isolated nodes having 2n nodes and k edges, with n nodes of each color. Here n >= 0, 0 <= k <= n². A123547