Properties of the Number 12389

Twelve Thousand Three Hundred Eighty-Nine

Basics

Value: 12388 → 12389 → 12390

Parity: odd

Prime: No

Previous Prime: 12379

Next Prime: 12391

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 13 × 953

Divisors: 1, 13, 953, 12389

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11000001100101

Octal: 30145

Duodecimal: 7205

Hexadecimal: 3065

Square: 153487321

Square Root: 111.30588483993108

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

a(n) = (2·n-1)*(5·n²-5·n+6)/6. A63489

An accelerator sequence for Catalan's constant. A94648

G.f. A(x) = ∑_n=-oo..+oo xⁿ * (1 + xⁿ)^2·n. A260147

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

Trace sequence of a path graph plus loop. A96975

One half of total number of round trips, each of length 2n, on the graph P₆ (o-o-o-o-o-o). A198636

Numerators of partial sums of reciprocals of lcm(1..n) = A003418(n). A64857

Rectangular array read by antidiagonals: row q has generating function F_q(x) = ∑_r=0,...,q-1 ((q-r)*(-1)^r*binomial(2·q-r,r)*x^r) / ∑_s=0,...,q ((-1)^s*binomial(2·q-s,s)*x^s), where q=1,2,.... A185095

Sequence read from antidiagonals of rectangular array with entry in row n and column q given by T(n,q) = 2^2·n*(∑_j=1..n+1 (cos(j*π/(2·q+1)))^2·n), n >= 0, q >= 1. A186740

a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[a(n) + a(n-1) + a(n-2) + a(n-3)], where SORT places digits in ascending order and deletes 0's. A108564