4,297,220

2² × 5 × 29 × 31 × 239

4,297,220 factors as 2^2 × 5 × 29 × 31 × 239. Its 48 positive divisors give a proper-divisor sum of 5,379,580, so this integer is abundant. The Collatz stopping time is 149 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 29 × 31 × 239

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 9,676,800

Proper Divisor Sum 5,379,580

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #4297207 ← → #4297259

Radix Representation

Decimal	4297220
Binary	10000011001001000000100 (23 bits)
Octal	0o20311004
Hexadecimal	0x419204

Divisor Catalog (48)

1 2 4 5 10 20 29 31 58 62 116 124 145 155 239 290 310 478 580 620 899 956 1,195 1,798 2,390 3,596 4,495 4,780 6,931 7,409 8,990 13,862 14,818 17,980 27,724 29,636 34,655 37,045 69,310 74,090 138,620 148,180 214,861 429,722 859,444 1,074,305 2,148,610 4,297,220

Collatz Trajectory (149 steps to reach 1)

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

4,297,220 2,148,610 1,074,305 3,222,916 1,611,458 805,729 2,417,188 1,208,594 604,297 1,812,892 906,446 453,223 1,359,670 679,835 2,039,506 1,019,753 3,059,260 1,529,630 764,815 2,294,446 1,147,223 3,441,670 1,720,835 5,162,506 2,581,253 7,743,760 3,871,880 1,935,940 967,970 483,985 1,451,956 725,978 362,989 1,088,968 544,484 272,242 136,121 408,364 204,182 102,091 306,274 153,137 459,412 229,706 114,853 344,560 172,280 86,140 43,070 21,535 64,606 32,303 96,910 48,455 145,366 72,683 218,050 109,025 327,076 163,538

← Previous Integer #4,297,219 Browse Full Index Next Integer #4,297,221 →