Properties of the Number -26581

Twenty-Six Thousand Five Hundred Eighty-One

Basics

Value: -26582 → -26581 → -26580

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 19 × 1399

Divisors: 1, 19, 1399, 26581

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011111010101

Octal: -63725

Duodecimal: -13471

Hexadecimal: -67d5

Square: 706549561

Square Root: 163.03680566056244

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

Corresponds to m = 9 in a family of 4th-order linear recurrence sequences given by a(m,n) = m⁴*a(n-4) + (2·m)²*a(n-3) - 4·a(m-1), a(m,0) = -1, a(m,1) = 4, a(m,2) = -13 + 6*(m-1) + 3*(m-1)², a(m,3) = (-8+m²)². A113255

Number of compositions of n into parts with multiplicity not larger than 6. A243084

Number of (w,x,y,z) with all terms in {0,...,n} and |w-x|=max{w,x,y,z}-min{w,x,y,z}. A212755

Setwise difference A340150 \ A340076. A340151

Number of arrays of median of three adjacent elements of some length n+2 0..2 array, with no adjacent equal elements in the latter. A229006

Triangle read by rows: T(n,m) = ∑_i=0..n+1 C(n-i+1,i-1)*C(n-i+1,i)*C(n-i+1,m-i+1). A298309