Properties of the Number -26515

Twenty-Six Thousand Five Hundred Fifteen

Basics

Value: -26516 → -26515 → -26514

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 5303

Divisors: 1, 5, 5303, 26515

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011110010011

Octal: -63623

Duodecimal: -13417

Hexadecimal: -6793

Square: 703045225

Square Root: 162.83427157696258

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

Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(m·n)+2 and prime(prime(m·n))+2 are both prime. A259487

Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths on an n X k grid which pass through four corners ((0,0), (0,k-1), (n-1,k-1), (n-1,0)). A333513

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n), where a(0) = 3, a(1) = 4, b(0) = 1, b(1) = 2, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295948

Number of self-avoiding closed paths on an n X 5 grid which pass through four corners ((0,0), (0,4), (n-1,4), (n-1,0)). A333515

Number of self-avoiding closed paths on an n X 7 grid which pass through four corners ((0,0), (0,6), (n-1,6), (n-1,0)). A358713

Number of (n+1)X(2+1) 0..2 arrays x(i,j) with every row sum{j·x(i,j), j=1..2+1} equal, and every column sum{i·x(i,j), i=1..n+1} equal. A232610

One third the number of solid partitions of n with 6 parts. A389773

Powers of fifth root of 20 rounded down. A18171