5,457,330

2 × 3² × 5 × 60637

5,457,330 factors as 2 × 3^2 × 5 × 60637. Its 24 positive divisors give a proper-divisor sum of 8,731,962, so this integer is abundant. The Collatz stopping time is 201 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 60637

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 14,189,292

Proper Divisor Sum 8,731,962

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5457293 ← → #5457337

Radix Representation

Decimal	5457330
Binary	10100110100010110110010 (23 bits)
Octal	0o24642662
Hexadecimal	0x5345B2

Divisor Catalog (24)

Collatz Trajectory (201 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

5,457,330 2,728,665 8,185,996 4,092,998 2,046,499 6,139,498 3,069,749 9,209,248 4,604,624 2,302,312 1,151,156 575,578 287,789 863,368 431,684 215,842 107,921 323,764 161,882 80,941 242,824 121,412 60,706 30,353 91,060 45,530 22,765 68,296 34,148 17,074 8,537 25,612 12,806 6,403 19,210 9,605 28,816 14,408 7,204 3,602 1,801 5,404 2,702 1,351 4,054 2,027 6,082 3,041 9,124 4,562 2,281 6,844 3,422 1,711 5,134 2,567 7,702 3,851 11,554 5,777

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,457,329 Browse Full Index Next Integer #5,457,331 →