5,877,588

2² × 3 × 489799

5,877,588 factors as 2^2 × 3 × 489799. Its 12 positive divisors give a proper-divisor sum of 7,836,812, so this integer is abundant. The Collatz stopping time is 183 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 489799

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,714,400

Proper Divisor Sum 7,836,812

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #5877587 ← → #5877601

Radix Representation

Decimal	5877588
Binary	10110011010111101010100 (23 bits)
Octal	0o26327524
Hexadecimal	0x59AF54

Divisor Catalog (12)

1 2 3 4 6 12 489,799 979,598 1,469,397 1,959,196 2,938,794 5,877,588

Collatz Trajectory (183 steps to reach 1)

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

5,877,588 2,938,794 1,469,397 4,408,192 2,204,096 1,102,048 551,024 275,512 137,756 68,878 34,439 103,318 51,659 154,978 77,489 232,468 116,234 58,117 174,352 87,176 43,588 21,794 10,897 32,692 16,346 8,173 24,520 12,260 6,130 3,065 9,196 4,598 2,299 6,898 3,449 10,348 5,174 2,587 7,762 3,881 11,644 5,822 2,911 8,734 4,367 13,102 6,551 19,654 9,827 29,482 14,741 44,224 22,112 11,056 5,528 2,764 1,382 691 2,074 1,037

← Previous Integer #5,877,587 Browse Full Index Next Integer #5,877,589 →