ℕ atory
Play Now

Properties of the Number -3288

Two Hundred Eighty-Eight

Basics

Value: -3289 → -3288 → -3287

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 3 × 3 × 137

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 137, 274

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110011011000

Octal: -6330

Duodecimal: -1AA0

Hexadecimal: -cd8

Square: 10810944

Square Root: 57.3410847473258

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 read by rows: T(n,k) is the k-th generalized Eulerian number of order n and degree 4, n >= 1. A211234
Triangle read by rows: T(n,k) (1 <= k <= n) given by T(n,1) = T(n,n) = 1, otherwise T(n,k) = (m·n-m·k+1)*T(n-1,k-1) + (m·k-m+1)*T(n-1,k), where m = -4. A392665
Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if n < k, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1). A64189
Motzkin triangle, T, read by rows; T(0,0) = T(1,0) = T(1,1) = 1; for n >= 2, T(n,0) = 1, T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k) for k = 1,2,...,n-1 and T(n,n) = T(n-1,n-2) + T(n-1,n-1). A26300
Numbers that can be expressed as the difference of the squares of primes in just two distinct ways. A90788
Numbers k such that k and k+1 are both primorial base Niven numbers (A333426). A333427
G.f. satisfies: A(x) = 1/(1-x) * A(x2)*A(x3)*A(x4)*...*A(xn)*... A129374
Numbers k such that k and k+1 are both base φ Niven numbers (A334308). A334309
T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once. A269052
T(n,k)=Number of nXk binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once. A269075