Factors & Divisors AnalysisClassification: Abundant
Divisor Count d(n)
24
Sum of Divisors σ(n)
1170
Proper Divisors Sum
810
Divisors & Factor Pairs
Complete Divisors List:
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120, 180, 360
Factor Pairs (A × B = 360):
1 × 360
2 × 180
3 × 120
4 × 90
5 × 72
6 × 60
8 × 45
9 × 40
10 × 36
12 × 30
15 × 24
18 × 20
Number Theory, Prime Decomposition & Roman Numerals Guide
Visual reference covering the Fundamental Theorem of Arithmetic, Euclidean GCD algorithm, Roman subtractive principles, and scientific order of magnitude scales.
1. The Evolution of Numerical Notations from Antiquity to Modern Science
Human civilization has devised numerous systems to record quantities. The Roman numeral system, originating in ancient Rome, was an additive and subtractive tallying framework optimized for carving on stone monuments and accounting on reckoning boards (abaci). While effective for recording dates and military cohorts, Roman numerals lacked a zero (nulla) and positional place value, rendering complex multiplication and division laborious.
The global adoption of the Hindu-Arabic decimal positional system (0 through 9) revolutionized trade and mathematics. When physical science expanded to cosmological and subatomic dimensions—from the mass of an electron (9.109 × 10⁻³¹ kg) to the observable universe (8.8 × 10²⁶ m)—positional decimal notation became unreadable without standard scientific and engineering notations.
2. The Fundamental Theorem of Arithmetic and Prime Numbers
Formulated by Carl Friedrich Gauss in his 1801 masterpiece Disquisitiones Arithmeticae, the Fundamental Theorem of Arithmetic states that every integer greater than 1 either is a prime itself or can be represented as the product of prime numbers in a way that is unique up to the order of the factors:
n = p₁^(a₁) · p₂^(a₂) ··· p_k^(a_k)
Prime numbers are the multiplicative 'atoms' of number theory. Modern cryptographic systems, such as RSA public-key encryption and Diffie-Hellman key exchanges, rely on the computational asymmetry between multiplying two large prime numbers (a trivial $O(n^2)$ operation) and factoring their product back into primes (a sub-exponential problem that is currently intractable for classical supercomputers).
3. The Euclidean Algorithm for Greatest Common Divisor
Recorded in Book VII of Euclid’s Elements (c. 300 BC), the Euclidean algorithm is the oldest non-trivial mathematical algorithm still in active use. It computes the Greatest Common Divisor (GCD) of two integers by repeatedly applying the division identity:
GCD(a, b) = GCD(b, a mod b)
Gabriel Lamé proved in 1844 that the number of division steps in the Euclidean algorithm never exceeds five times the number of digits in the smaller integer, establishing its logarithmic time complexity O(log(min(a, b))). Once the GCD is known, the Least Common Multiple (LCM) is derived instantaneously via the reciprocal product identity:
LCM(a, b) = (|a · b|) / GCD(a, b)