Properties of the Number 2489

Two Thousand Four Hundred Eighty-Nine

Basics

Value: 2488 → 2489 → 2490

Parity: odd

Prime: No

Previous Prime: 2477

Next Prime: 2503

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 19 × 131

Divisors: 1, 19, 131, 2489

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100110111001

Octal: 4671

Duodecimal: 1535

Hexadecimal: 9b9

Square: 6195121

Square Root: 49.889878733065686

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

Heinz numbers of integer partitions with the same product of parts as their conjugate. A325040

Number of primes < prime(n)². A879

a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n+1-k), where k = [ (n+1)/2 ], p = A000040 = the primes. A24697

ATS: Add Then Sort (i.e., double previous term and then sort digits). A57615

a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes. A25129

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7. A252407

Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of permutations of n and k occurrences of the pattern 312. A263771

Concatenate n with n-th prime. A45532

Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists. A69554

a(n) = n*(3·n + 17)/2. A140674