Properties of the Number -3255

Two Hundred Fifty-Five

Basics

Value: -3256 → -3255 → -3254

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 31

Divisors: 1, 3, 5, 7, 15, 21, 31, 35, 93, 105

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110010110111

Octal: -6267

Duodecimal: -1A73

Hexadecimal: -cb7

Square: 10595025

Square Root: 57.05260730238365

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 of generalized Stirling numbers of the first kind read by rows: T(n, k) = (-1)^n+k*∑_m=0..n Stirling1(n, m) * binomial(m, k) * 2^m-k, where Stirling1 is A048994. A94646

a(n) = ∑_{k=0..floor(n/4)} (-1)^k * binomial(n+3,4·k+3) * Catalan(k). A360050

Numerator of Bernoulli(n, -10/11). A159487

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

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

a(n) = sigma₂(n): sum of squares of divisors of n. A1157

Numbers k such that φ(k) = φ(k+1). A1274

Sums of distinct powers of 5. A33042

Let f(n) = number of ways to factor n = A001055(n); a(n) = sum of f(k) over all terms k in A025487 that have n factors. A35310

7 times triangular numbers: 7·n*(n+1)/2. A24966