2,408,588

2² × 7 × 13² × 509

2,408,588 factors as 2^2 × 7 × 13^2 × 509. Its 36 positive divisors give a proper-divisor sum of 2,817,892, so this integer is abundant. The Collatz stopping time is 161 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 13^2 × 509

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 5,226,480

Proper Divisor Sum 2,817,892

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #2408587 ← → #2408603

Radix Representation

Decimal	2408588
Binary	1001001100000010001100 (22 bits)
Octal	0o11140214
Hexadecimal	0x24C08C

Divisor Catalog (36)

Collatz Trajectory (161 steps to reach 1)

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

2,408,588 1,204,294 602,147 1,806,442 903,221 2,709,664 1,354,832 677,416 338,708 169,354 84,677 254,032 127,016 63,508 31,754 15,877 47,632 23,816 11,908 5,954 2,977 8,932 4,466 2,233 6,700 3,350 1,675 5,026 2,513 7,540 3,770 1,885 5,656 2,828 1,414 707 2,122 1,061 3,184 1,592 796 398 199 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286 143 430

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,408,587 Browse Full Index Next Integer #2,408,589 →