Properties of the Number -3228

Two Hundred Twenty-Eight

Basics

Value: -3229 → -3228 → -3227

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 269

Divisors: 1, 2, 3, 4, 6, 12, 269, 538, 807, 1076

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110010011100

Octal: -6234

Duodecimal: -1A50

Hexadecimal: -c9c

Square: 10419984

Square Root: 56.815490845367165

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

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 10. A60029

a(n) = ((n²+1)³) - s, where s is the nearest square to (n²+1)³. A233149

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 3 + 2·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2·x - x². A367300

Iccanobirt prime indices (15 of 15): Indices of prime numbers in A102125. A102145

Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 11 multiples of n-1, n-2, ..., 1, for n>=1. A113748

Molien series for invariants of finite Coxeter group D₁₂ (bisected). A266775

Integers having ideal digital mean up to base 4. A144799

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299321

a(n) = n! * ∑_k=1..n sigma₀(k)/k. A356297

Relative of Hofstadter Q-sequence: a(n) = max(0, n+3201) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A373236