5,962,912

2⁵ × 31 × 6011

5,962,912 factors as 2^5 × 31 × 6011. Its 24 positive divisors give a proper-divisor sum of 6,157,280, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^5 × 31 × 6011

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 12,120,192

Proper Divisor Sum 6,157,280

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #5962909 ← → #5962919

Radix Representation

Decimal	5962912
Binary	10110101111110010100000 (23 bits)
Octal	0o26576240
Hexadecimal	0x5AFCA0

Divisor Catalog (24)

Collatz Trajectory (121 steps to reach 1)

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

5,962,912 2,981,456 1,490,728 745,364 372,682 186,341 559,024 279,512 139,756 69,878 34,939 104,818 52,409 157,228 78,614 39,307 117,922 58,961 176,884 88,442 44,221 132,664 66,332 33,166 16,583 49,750 24,875 74,626 37,313 111,940 55,970 27,985 83,956 41,978 20,989 62,968 31,484 15,742 7,871 23,614 11,807 35,422 17,711 53,134 26,567 79,702 39,851 119,554 59,777 179,332 89,666 44,833 134,500 67,250 33,625 100,876 50,438 25,219 75,658 37,829

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,962,911 Browse Full Index Next Integer #5,962,913 →