Properties of the Number 12869

Twelve Thousand Eight Hundred Sixty-Nine

Basics

Value: 12868 → 12869 → 12870

Parity: odd

Prime: No

Previous Prime: 12853

Next Prime: 12889

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 17 × 757

Divisors: 1, 17, 757, 12869

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001001000101

Octal: 31105

Duodecimal: 7545

Hexadecimal: 3245

Square: 165611161

Square Root: 113.44161493913951

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 combinations of n things from 1 to n at a time, with repeats allowed. A30662

Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1). A47909

Central binomial coefficient - 1. A14495

T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r. A50157

Number of distinct prime signatures of the positive integers up to 2ⁿ. A25488

Continued fraction expansion of ∑_k>=0 1/(2^k)!. A387398

A(n,k) = ∑_i₁=0..n ∑_i₂=0..n ... ∑_{i_k=0..n} multinomial(i₁ + i₂ + ... + i_k; i₁, i₂, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0. A308292

Number of 2n-bead balanced binary necklaces of fundamental period 2n equivalent to reverse. A45680

G.f.: ∑_n>=0 ((1+x)ⁿ - 1)ⁿ / (1+x)^n². A220352

Odd semiprimes k = p·q such that k = A325820(p,q), with p, q primes > 3, and A325820 is the carryless base-3 multiplication. A391331