Properties of the Number 6585

Six Thousand Five Hundred Eighty-Five

Basics

Value: 6584 → 6585 → 6586

Parity: odd

Prime: No

Previous Prime: 6581

Next Prime: 6599

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 439

Divisors: 1, 3, 5, 15, 439, 1317, 2195, 6585

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100110111001

Octal: 14671

Duodecimal: 3989

Hexadecimal: 19b9

Square: 43362225

Square Root: 81.14801291467339

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

Trajectory of 442 under the Reverse and Add! operation carried out in base 2. A75268

Dirichlet convolution of 3^n-1 with φ(n). A34754

Numbers 1 through 10000 sorted lexicographically in ternary representation. A190128

Let p = n-th prime == 3 mod 4; a(n) = (sum of quadratic nonresidues mod p) - (sum of quadratic residues mod p). A282037

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A299668

G.f. A(x) satisfies: 1+x = 2·A(x)³ - A(x)⁵. A249927

Odd numbers k for which gcd(k, A003961(k)) = gcd(σ(k), A003961(k)) > 1, where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and σ is the sum of divisors function. A349176

a(n) = 6·a(n-1)-8·a(n-2)-9 for n > 10; a(0)=629, a(1)=6585, a(2)=26259, a(3)=221931, a(4)=1917027, a(5)=18285939, a(6)=125792217, a(7)=703932681, a(8)=7131271077, a(9)=26172260445, a(10)=103884128445. A177421

a(n) = n*(15·n-11)/2. A226489

Numbers m with C(2·m, m) - prime(m) prime, where C(2·m, m) = (2·m)!/(m!)². A236248