2520

View full site to see MathJax equation

2520 < 2519 | 2521 >
All Numbers
2500	2501	2502	2503	2504	2505	2506	2507	2508	2509
2510	2511	2512	2513	2514	2515	2516	2517	2518	2519
2520	2521	2522	2523	2524	2525	2526	2527	2528	2529
2530	2531	2532	2533	2534	2535	2536	2537	2538	2539
2540	2541	2542	2543	2544	2545	2546	2547	2548	2549
2550	2551	2552	2553	2554	2555	2556	2557	2558	2559
2560	2561	2562	2563	2564	2565	2566	2567	2568	2569
2570	2571	2572	2573	2574	2575	2576	2577	2578	2579
2580	2581	2582	2583	2584	2585	2586	2587	2588	2589
2590	2591	2592	2593	2594	2595	2596	2597	2598	2599

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:

• \(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 A₇. It is also the maximum possible cycle length of any given algorithm on the Rubik's cube (one such algorithm is "RL2U'F'd").

Its prime factorization is 2³ × 3² × 5 × 7.

In Argam nomenclature, 2,520 is called "kinsevoctove", or "kinsove" for short.

Approximations

Notation	Lower bound	Upper bound
Up-arrow notation	50 ↑ 2
Scientific notation	2.52 x 103	2.521 x 103
Slow-growing hierarchy	\(g_{\omega^{\omega}}(4)\)	\(g_{\omega^{\omega}}(5)\)
Copy notation	24[2]	25[2]
Chained arrow notation	50 → 2
Bowers' Exploding Array Function/Bird's array notation	{50,2}
Fast-growing hierarchy	f2(8)	f2(9)
Hardy hierarchy	Hω(1260)	Hω(1260)
Middle-growing hierarchy	m(ω,11)	m(ω,12)
Hyper-E notation	E3.4014
Hyper-E notation (non-10 base)	\(E[50]2\)
Hyperfactorial array notation	6!	7!
X-Sequence Hyper-Exponential Notation	50{1}2
Steinhaus-Moser Notation	4[3]	5[3]
PlantStar's Debut Notation	[2]	[3]
H* function	H(0.1)	H(0.2)
Bashicu matrix system with respect to version 4	(0)[50]	(0)[51]
m(n) map	m(1)(4)	m(1)(5)
s(n) map	\(s(1)(\lambda x . x+1)(1259)\)	\(s(1)(\lambda x . x+1)(1260)\)