7,065,924

2² × 3 × 588827

7,065,924 factors as 2^2 × 3 × 588827. Its 12 positive divisors give a proper-divisor sum of 9,421,260, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 588827

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 16,487,184

Proper Divisor Sum 9,421,260

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #7065911 ← → #7065941

Radix Representation

Decimal	7065924
Binary	11010111101000101000100 (23 bits)
Octal	0o32750504
Hexadecimal	0x6BD144

Divisor Catalog (12)

1 2 3 4 6 12 588,827 1,177,654 1,766,481 2,355,308 3,532,962 7,065,924

Collatz Trajectory (147 steps to reach 1)

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

7,065,924 3,532,962 1,766,481 5,299,444 2,649,722 1,324,861 3,974,584 1,987,292 993,646 496,823 1,490,470 745,235 2,235,706 1,117,853 3,353,560 1,676,780 838,390 419,195 1,257,586 628,793 1,886,380 943,190 471,595 1,414,786 707,393 2,122,180 1,061,090 530,545 1,591,636 795,818 397,909 1,193,728 596,864 298,432 149,216 74,608 37,304 18,652 9,326 4,663 13,990 6,995 20,986 10,493 31,480 15,740 7,870 3,935 11,806 5,903 17,710 8,855 26,566 13,283 39,850 19,925 59,776 29,888 14,944 7,472

← Previous Integer #7,065,923 Browse Full Index Next Integer #7,065,925 →