5,864,604

2² × 3 × 488717

5,864,604 factors as 2^2 × 3 × 488717. Its 12 positive divisors give a proper-divisor sum of 7,819,500, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 488717

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,684,104

Proper Divisor Sum 7,819,500

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5864603 ← → #5864623

Radix Representation

Decimal	5864604
Binary	10110010111110010011100 (23 bits)
Octal	0o26276234
Hexadecimal	0x597C9C

Divisor Catalog (12)

1 2 3 4 6 12 488,717 977,434 1,466,151 1,954,868 2,932,302 5,864,604

Collatz Trajectory (196 steps to reach 1)

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

5,864,604 2,932,302 1,466,151 4,398,454 2,199,227 6,597,682 3,298,841 9,896,524 4,948,262 2,474,131 7,422,394 3,711,197 11,133,592 5,566,796 2,783,398 1,391,699 4,175,098 2,087,549 6,262,648 3,131,324 1,565,662 782,831 2,348,494 1,174,247 3,522,742 1,761,371 5,284,114 2,642,057 7,926,172 3,963,086 1,981,543 5,944,630 2,972,315 8,916,946 4,458,473 13,375,420 6,687,710 3,343,855 10,031,566 5,015,783 15,047,350 7,523,675 22,571,026 11,285,513 33,856,540 16,928,270 8,464,135 25,392,406 12,696,203 38,088,610 19,044,305 57,132,916 28,566,458 14,283,229 42,849,688 21,424,844 10,712,422 5,356,211 16,068,634 8,034,317

← Previous Integer #5,864,603 Browse Full Index Next Integer #5,864,605 →