2,520 is the 7th superior highly composite number, with 48 divisors, and also the smallest positive integer that can be divided with numbers from 1 to 10:[1]
- \(2,520 \div 1 = 2,520\)
- \(2,520 \div 2 = 1,260\)
- \(2,520 \div 3 = 840\)
- \(2,520 \div 4 = 630\)
- \(2,520 \div 5 = 504\)
- \(2,520 \div 6 = 420\)
- \(2,520 \div 7 = 360\)
- \(2,520 \div 8 = 315\)
- \(2,520 \div 9 = 280\)
- \(2,520 \div 10 = 252\)
In other words, it's the weak factorial of 9, or 10.
2,520 is the order of the simple group A7. It is also the maximum possible cycle length of any given algorithm on the Rubik's cube (one such algorithm is "RL2U'F'd").[2]
Its prime factorization is 23 × 32 × 5 × 7.
In Argam nomenclature, 2,520 is called "kinsevoctove", or "kinsove" for short.