Properties of the Number -3227

Two Hundred Twenty-Seven

Basics

Value: -3228 → -3227 → -3226

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 7 × 461

Divisors: 1, 7, 461, 3227

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110010011011

Octal: -6233

Duodecimal: -1A4B

Hexadecimal: -c9b

Square: 10413529

Square Root: 56.806689746895124

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

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood. A269813

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

Smallest value of·such that M(x) = n, where M() is Mertens's function A002321. A51400

Number of partitions of n containing a clique of size 8. A183565

a(n) = 70·n - 63. A139264

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001001. A259962

Sum of the smallest parts in the partitions of n into 8 parts. A308990

Number of partitions p of n into distinct parts such that max(p) >= 2·min(p). A241036

Row lengths of A368946: in the MIU formal system, number of (possibly not distinct) strings n steps distant from the MI string. A368947

T(n, 2·n-3), T given by A027960. A27965