Properties of the Number 6489

Six Thousand Four Hundred Eighty-Nine

Basics

Value: 6488 → 6489 → 6490

Parity: odd

Prime: No

Previous Prime: 6481

Next Prime: 6491

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 103

Divisors: 1, 3, 7, 9, 21, 63, 103, 309, 721, 927

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101011001

Octal: 14531

Duodecimal: 3909

Hexadecimal: 1959

Square: 42107121

Square Root: 80.55432949258531

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

Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1). A10027

Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x₁,x₂,...,x_n) is a position i such that x_i - x_i+1 = 1. A123513

Total number of vertices in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces, counting coinciding intersection points only once. A331782

Number of permutations of length n with 2 consecutive ascending pairs. A274

Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition. A57949

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

Integers that need 6 iterations of the map x->A352172(x) to reach 1. A352264

Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition. A57950

Partial sums of A130237. A130238

Numbers M(n) which are the number of terms in the sums of consecutive cubed integers equaling a squared integer, b³ + (b+1)³ + ... + (b+M-1)³ = c², for a first term b(n) being an odd squared integer (A016754). A253707