Properties of the Number 12819

Twelve Thousand Eight Hundred Nineteen

Basics

Value: 12818 → 12819 → 12820

Parity: odd

Prime: No

Previous Prime: 12809

Next Prime: 12821

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 4273

Divisors: 1, 3, 4273, 12819

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001000010011

Octal: 31023

Duodecimal: 7503

Hexadecimal: 3213

Square: 164326761

Square Root: 113.22102278287367

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

Numbers k such that 2^k - 7 is prime. A59609

Number of twice-partitions of n into partitions with weakly decreasing lengths. A358831

Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n. A111389

Numbers n which are neither palindromes nor the sum of two palindromes, with property that the largest palindrome which when subtracted from n yields the sum of two palindromes is not the palindromic floor of n (A261423(n)), but rather the next palindrome below that. A261911

a(n) = F(n+4) * F(n+1) - 4 * (-1)ⁿ where F(n) = A000045(n) are the Fibonacci numbers. A341208

The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times. A381087

a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists. A381183

Numbers k such that 3·10^k + 8·R_k - 7 is a prime, where R_k = 11...1 is the repunit (A002275) of length k. A102978

G.f. satisfies: A(x) = ∏_n>=1 1/(1 - xⁿ*A(x)^n²). A192768

Apparently solves the identity: Find sequence A that represents the numbers of ordered compositions of n into the elements of the set {B}; and vice versa. A224341