Properties of the Number -12865

Twelve Thousand Eight Hundred Sixty-Five

Basics

Value: -12866 → -12865 → -12864

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 31 × 83

Divisors: 1, 5, 31, 83, 155, 415, 2573, 12865

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001001000001

Octal: -31101

Duodecimal: -7541

Hexadecimal: -3241

Square: 165508225

Square Root: 113.42398335449165

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

Expansion of e.g.f. log(1 + arcsinh(x))*exp(x). A296437

Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to bottom row, and no 1 having more than two 1's adjacent. A391822

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A240046

Partial sums of A000132. A175360

Numbers k with exactly three distinct prime factors and such that cototient(k) is a square. A306670

a(n) = (p(n)*p(n+2) - 3·p(n+1))/2, where p(n) is the n-th odd prime. A152529

Number of ON cells after n generations of two-dimensional automaton based on knight moves (see Comments for definition; here a cell is turned ON if 1 or 2 neighbors are ON). A322055

Number of n X 4 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent. A163716

Number of n X 7 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent. A163728

Number of length n 1..(1+2) arrays with no leading or trailing partial sum equal to a prime. A254197