Properties of the Number 12868

Twelve Thousand Eight Hundred Sixty-Eight

Basics

Value: 12867 → 12868 → 12869

Parity: even

Prime: No

Previous Prime: 12853

Next Prime: 12889

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 3217

Divisors: 1, 2, 4, 3217, 6434, 12868

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11001001000100

Octal: 31104

Duodecimal: 7544

Hexadecimal: 3244

Square: 165585424

Square Root: 113.43720729989786

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 of different ways to select n elements from two sets of n elements under the precondition of choosing at least one element from each set. A115112

a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists. A350241

Number of binary words of length n with exactly one occurrence of subword 010 and exactly one occurrence of subword 101. A255386

Let (u1,u2) be successive untouchable numbers such that φ(u1) = φ(u2); sequence gives values of u1. A48189

Integer part of Gauss's Arithmetic-Geometric Mean M(2,n⁵). A127766

Number of n X 8 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order. A166813

T(n,k) = Sum of multinomial(n; n₁,n₂,...,n_k)², where the sum extends over all compositions (n₁,n₂,...,n_k) of n into exactly k nonnegative parts. A192722

Irregular triangle read by rows: T(n,d) (n >= 1, d <= n-1 for n>1) = number of n X n integer-valued matrices M such that M_1,1=0, M_n,n=d, M_(i+1),j = M_i,j + (0 or 1), M_i,(j+1) = M_i,j + (0 or 1), and M_(i+1),(j+1) = M_i,j + (0 or 1). A323848

Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone. A259051

Number of lines through exactly 5 points of an n X n grid of points. A18812