Properties of the Number 12489

Twelve Thousand Four Hundred Eighty-Nine

Basics

Value: 12488 → 12489 → 12490

Parity: odd

Prime: No

Previous Prime: 12487

Next Prime: 12491

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 × 181

Divisors: 1, 3, 23, 69, 181, 543, 4163, 12489

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000011001001

Octal: 30311

Duodecimal: 7289

Hexadecimal: 30c9

Square: 155975121

Square Root: 111.75419455215092

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

G.f.: 1/(1-2x-15x²)^1/2; also, a(n) is the central coefficient of (1+x+4x²)ⁿ. A84605

Numbers for which the sum of the digits is the square root of the product of their digits. A117720

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2·x + (1-4·k²)*x²). A307847

Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 4x²)ⁿ. A84604

Integers k such that nextprime(k⁵) - prevprime(k⁵) = 4. A90123

MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed). A326260

The Wiener index of the Dutch windmill graph D(5,n) (n>=1). A180579

Number of length 2+2 0..n arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251429

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 253", based on the 5-celled von Neumann neighborhood. A271052

Triangle read by rows: T(n,k) = number of colored weighted Motzkin paths ending at (n,k). A293171