Properties of the Number -3295

Two Hundred Ninety-Five

Basics

Value: -3296 → -3295 → -3294

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 659

Divisors: 1, 5, 659, 3295

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110011011111

Octal: -6337

Duodecimal: -1AA7

Hexadecimal: -cdf

Square: 10857025

Square Root: 57.40209055426466

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 411", based on the 5-celled von Neumann neighborhood. A271892

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

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

Values z of primitive solutions (x, y, z) to the Diophantine equation 2·x³ + 2·y³ + z³ = 1. A338239

Total number of ON states after n generations of cellular automaton based on hexagons. A151723

Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 7 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=2·floor(n/3), read by rows. A238556

Number of self-dual binary codes of length 2n (up to column permutation equivalence). A3179

Composite and every divisor (except 1) contains the digit 5. A62672

Number of partitions of n in which each part, with the possible exception of the largest, occurs at least three times. A116932

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