4,125,588

2² × 3 × 343799

4,125,588 factors as 2^2 × 3 × 343799. Its 12 positive divisors give a proper-divisor sum of 5,500,812, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 343799

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,626,400

Proper Divisor Sum 5,500,812

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4125587 ← → #4125593

Radix Representation

Decimal	4125588
Binary	1111101111001110010100 (22 bits)
Octal	0o17571624
Hexadecimal	0x3EF394

Divisor Catalog (12)

1 2 3 4 6 12 343,799 687,598 1,031,397 1,375,196 2,062,794 4,125,588

Collatz Trajectory (136 steps to reach 1)

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

4,125,588 2,062,794 1,031,397 3,094,192 1,547,096 773,548 386,774 193,387 580,162 290,081 870,244 435,122 217,561 652,684 326,342 163,171 489,514 244,757 734,272 367,136 183,568 91,784 45,892 22,946 11,473 34,420 17,210 8,605 25,816 12,908 6,454 3,227 9,682 4,841 14,524 7,262 3,631 10,894 5,447 16,342 8,171 24,514 12,257 36,772 18,386 9,193 27,580 13,790 6,895 20,686 10,343 31,030 15,515 46,546 23,273 69,820 34,910 17,455 52,366 26,183

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,125,587 Browse Full Index Next Integer #4,125,589 →