Properties of the Number -2670

Six Hundred Seventy

Basics

Value: -2671 → -2670 → -2669

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 89

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 89, 178

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101001101110

Octal: -5156

Duodecimal: -1666

Hexadecimal: -a6e

Square: 7128900

Square Root: 51.67204273105525

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

Triangle, row sums = a signed, shifted version of A000587, the Rao Uppuluri-Carpenter numbers. A144185

Pentagonal numbers multiplied by 2: a(n) = n*(3·n-1). A49450

Convolution of A000203 with itself. A385

Numbers m such that there are precisely 8 groups of order m. A249551

Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay). A8610

a(n)=A089551(n)/2. A89558

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252305

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250853

Numbers divisible by prime(d) for each digit d in their base-4 representation, none of which may be zero. A256874

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array. A219939