Properties of the Number -2565

Five Hundred Sixty-Five

Basics

Value: -2566 → -2565 → -2564

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 19

Divisors: 1, 3, 5, 9, 15, 19, 27, 45, 57, 95

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101000000101

Octal: -5005

Duodecimal: -1599

Hexadecimal: -a05

Square: 6579225

Square Root: 50.6458290484024

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

Reversion of g.f. (with constant term included) for partition numbers. A66398

Expansion of ∏_k>=1 (1-x^3·k-1)^3·k-1 * (1-x^3·k-2)^3·k-2. A285247

Expansion of (1-x)^-1/(1-2·x²+x³). A77880

Triangle of coefficients of a Pascal sum of recursive orthogonal Hermite polynomials given in Hochstadt's book: P(x, n) = x·P(x, n - 1) - n·P(x, n - 2); p2(x,n)=Sum[Binomial[n,m],{m,0,n}]. A136645

Number of integer partitions of n whose distinct parts are connected. A304716

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 4.8.8 2D tiling (cf. A008576). A299259

Sum of 10 positive 9th powers. A3399

Numbers with one fewer divisors than the sum of their prime indices. A325694

Triangular matrix T, read by rows, that satisfies: [T^k](n,k) = T(n,k-1) for n>=k>0, or, equivalently, (column k of T^k) = SHIFT_LEFT(column k-1 of T) when zeros above the diagonal are ignored. A107876

a(n) = a(n-1) + 2·a(n-3) with a(0)=a(1)=1, a(2)=3. A3229