Properties of the Number 12895

Twelve Thousand Eight Hundred Ninety-Five

Basics

Value: 12894 → 12895 → 12896

Parity: odd

Prime: No

Previous Prime: 12893

Next Prime: 12899

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 2579

Divisors: 1, 5, 2579, 12895

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001001011111

Octal: 31137

Duodecimal: 7567

Hexadecimal: 325f

Square: 166281025

Square Root: 113.55615351005862

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

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock. A186568

Numbers k such that the continued fraction for sqrt(k) has period 100. A20439

Triangle of coefficients of g.f. a*(1+x)ⁿ + b*(1-x)ⁿ⁺²*polylog(-n-1, x)/x + 2ⁿ*c*(1-x)ⁿ⁺¹*LerchPhi(x, -n, 1/2), with a = -2, b = 2, c = 1. A168524

Number of (w,x,y,z) with all terms in {1,...,n} and 2w·x<=3·y*z. A211921

Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 7). A212387

Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i. A244244

Triangle read by rows: T(n,k) = number of free hexagonal polyominoes with n cells, where the maximum number of collinear cell centers on any line in the plane is k. A378015

Number of (n+2) X 6 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock. A186563

Number of (n+2) X 8 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock. A186565

a(1)=2, a(2)=3; then a(n+1) = smallest k such that S(k) = S(a(n)) + S(a(n-1)), (n>=2), where S is sopfr (A001414). A330988