Properties of the Number 2520

Two Thousand Five Hundred Twenty

Basics

Value: 2519 → 2520 → 2521

Parity: even

Prime: No

Previous Prime: 2503

Next Prime: 2521

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 5 × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111011000

Octal: 4730

Duodecimal: 1560

Hexadecimal: 9d8

Square: 6350400

Square Root: 50.19960159204453

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

Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record. A2182

a(n) = denominator of harmonic number H(n) = ∑_i=1..n 1/i. A2805

Least common multiple (or LCM) of {1, 2, ..., n} for n >= 1, a(0) = 1. A3418

Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle. A1263

Order of alternating group A_n, or number of even permutations of n letters. A1710

4 times triangular numbers: a(n) = 2·n*(n+1). A46092

Primorial inflation of n: Fully multiplicative with a(p) = p# for prime p, where x# is the primorial A034386(x). A108951

Triangle T(n,k) = n!/(n-k)! (0 <= k <= n) read by rows, giving number of permutations of n things k at a time. A8279

Triangle T(n,k) read by rows: multinomial coefficients for the partitions of n listed in Abramowitz-Stegun order, 1 <= k <= A000041(n). A36038

Superabundant [or super-abundant] numbers: n such that σ(n)/n > σ(m)/m for all m < n, σ(n) being A000203(n), the sum of the divisors of n. A4394