Properties of the Number 12885

Twelve Thousand Eight Hundred Eighty-Five

Basics

Value: 12884 → 12885 → 12886

Parity: odd

Prime: No

Previous Prime: 12853

Next Prime: 12889

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 859

Divisors: 1, 3, 5, 15, 859, 2577, 4295, 12885

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001001010101

Octal: 31125

Duodecimal: 7559

Hexadecimal: 3255

Square: 166023225

Square Root: 113.51211389098522

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

Number A(n,k) of n-tuples (p₁, p₂, ..., p_n) of positive integers such that p_i-1 <= p_i <= k^i-1; square array A(n,k), n>=0, k>=0, read by antidiagonals. A355576

To compute a(n) we first write down 5ⁿ 1's in a row. Each row takes the rightmost 5th part of the previous row and each element in it equals sum of the elements of the previous row starting with the first of the rightmost 5th part. The single element in the last row is a(n). A109057

Pseudoprimes to base 9, written in base 9. A262154

Number of unlabeled disconnected series-parallel posets with n nodes. A7454

a(n) is the smallest index m such that ∑_k=2..m 1/PrimePi(k) >= n, where PrimePi()=A000720(). A74633

a(n) = n³ + sum((-1)^j*a(j)); for j=1 to n-1; a(1)=1. A153286

Numbers m such that (4^m + 5) / 3 is prime. A261539

a(n) = ∑_d∣n (-1)^n/d-1 * binomial(d+2,3). A366813

Triangle of coefficients of polynomials v(n,x) jointly generated with A208761; see the Formula section. A208762

The reversing binary representation of the sum of the divisors of the n-th odd square: a(n) = A065621(A379223(n)). A379224