4,752,012

2² × 3 × 396001

4,752,012 factors as 2^2 × 3 × 396001. Its 12 positive divisors give a proper-divisor sum of 6,336,044, so this integer is abundant. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 396001

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 11,088,056

Proper Divisor Sum 6,336,044

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4752001 ← → #4752017

Radix Representation

Decimal	4752012
Binary	10010001000001010001100 (23 bits)
Octal	0o22101214
Hexadecimal	0x48828C

Divisor Catalog (12)

1 2 3 4 6 12 396,001 792,002 1,188,003 1,584,004 2,376,006 4,752,012

Collatz Trajectory (118 steps to reach 1)

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

4,752,012 2,376,006 1,188,003 3,564,010 1,782,005 5,346,016 2,673,008 1,336,504 668,252 334,126 167,063 501,190 250,595 751,786 375,893 1,127,680 563,840 281,920 140,960 70,480 35,240 17,620 8,810 4,405 13,216 6,608 3,304 1,652 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,752,011 Browse Full Index Next Integer #4,752,013 →