4,212,468

2² × 3² × 13 × 9001

4,212,468 factors as 2^2 × 3^2 × 13 × 9001. Its 36 positive divisors give a proper-divisor sum of 7,256,080, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 13 × 9001

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 11,468,548

Proper Divisor Sum 7,256,080

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4212457 ← → #4212479

Radix Representation

Decimal	4212468
Binary	10000000100011011110100 (23 bits)
Octal	0o20043364
Hexadecimal	0x4046F4

Divisor Catalog (36)

1 2 3 4 6 9 12 13 18 26 36 39 52 78 117 156 234 468 9,001 18,002 27,003 36,004 54,006 81,009 108,012 117,013 162,018 234,026 324,036 351,039 468,052 702,078 1,053,117 1,404,156 2,106,234 4,212,468

Collatz Trajectory (154 steps to reach 1)

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

4,212,468 2,106,234 1,053,117 3,159,352 1,579,676 789,838 394,919 1,184,758 592,379 1,777,138 888,569 2,665,708 1,332,854 666,427 1,999,282 999,641 2,998,924 1,499,462 749,731 2,249,194 1,124,597 3,373,792 1,686,896 843,448 421,724 210,862 105,431 316,294 158,147 474,442 237,221 711,664 355,832 177,916 88,958 44,479 133,438 66,719 200,158 100,079 300,238 150,119 450,358 225,179 675,538 337,769 1,013,308 506,654 253,327 759,982 379,991 1,139,974 569,987 1,709,962 854,981 2,564,944 1,282,472 641,236 320,618 160,309

← Previous Integer #4,212,467 Browse Full Index Next Integer #4,212,469 →