Properties of the Number -7002

Two

Basics

Value: -7003 → -7002 → -7001

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 389

Divisors: 1, 2, 3, 6, 9, 18, 389, 778, 1167, 2334

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101101011010

Octal: -15532

Duodecimal: -4076

Hexadecimal: -1b5a

Square: 49028004

Square Root: 83.67795408588812

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

Square array T(n,k) (n >= 1, k >= 0) read by antidiagonals: coordination sequence for root lattice A_n. A103881

Coordination sequence for (3,3,4) tiling of hyperbolic plane. A265071

Numbers n such that Bernoulli number B_n has denominator 798. A272138

Number of integer partitions of n with all pairs of consecutive parts relatively prime. A328172

Number A(n,k) of sequences with k copies each of 1,2,...,n avoiding absolute differences between adjacent elements larger than one; square array A(n,k), n>=0, k>=0, read by antidiagonals. A331562

Number of ways to place 4 nonattacking queens on an n X n board. A61994

a(n) = ∑_i=0..n C(n+1,i)*C(n-1,i-1)*C(2n-i,n). A103882

Number T(n,k) of ways to place k nonattacking queens on an n X n board; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A348129

a(n) = (11·n² - 7·n)/2. A180223

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252861