Properties of the Number 2584

Two Thousand Five Hundred Eighty-Four

Basics

Value: 2583 → 2584 → 2585

Parity: even

Prime: No

Previous Prime: 2579

Next Prime: 2591

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 17 × 19

Divisors: 1, 2, 4, 8, 17, 19, 34, 38, 68, 76

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101000011000

Octal: 5030

Duodecimal: 15B4

Hexadecimal: a18

Square: 6677056

Square Root: 50.83306010855534

Classification

Fibonacci: Yes

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

Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1. A45

Coordination sequence T1 for Zeolite Code ABW and ATN. A8000

Sum of the first n primes. A7504

F(2n) = bisection of Fibonacci sequence: a(n) = 3·a(n-1) - a(n-2). A1906

Centered triangular numbers: a(n) = 3·n*(n-1)/2 + 1. A5448

Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed). A23108

a(n+2) = -a(n+1) + a(n) (signed Fibonacci numbers) with a(-2) = a(-1) = 1; or Fibonacci numbers (A000045) extended to negative indices. A39834

Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers). A71395

a(0) = 1, a(n) = Fibonacci(2·n). It has the property that a(n) = 1·a(n-1) + 2·a(n-2) + 3·a(n-3) + 4·a(n-4) + ... A88305

Expansion of (1 - x)/(1 - x - x²). A212804