4,315,188

2² × 3 × 359599

4,315,188 factors as 2^2 × 3 × 359599. Its 12 positive divisors give a proper-divisor sum of 5,753,612, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 359599

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,068,800

Proper Divisor Sum 5,753,612

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4315187 ← → #4315219

Radix Representation

Decimal	4315188
Binary	10000011101100000110100 (23 bits)
Octal	0o20354064
Hexadecimal	0x41D834

Divisor Catalog (12)

1 2 3 4 6 12 359,599 719,198 1,078,797 1,438,396 2,157,594 4,315,188

Collatz Trajectory (167 steps to reach 1)

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

4,315,188 2,157,594 1,078,797 3,236,392 1,618,196 809,098 404,549 1,213,648 606,824 303,412 151,706 75,853 227,560 113,780 56,890 28,445 85,336 42,668 21,334 10,667 32,002 16,001 48,004 24,002 12,001 36,004 18,002 9,001 27,004 13,502 6,751 20,254 10,127 30,382 15,191 45,574 22,787 68,362 34,181 102,544 51,272 25,636 12,818 6,409 19,228 9,614 4,807 14,422 7,211 21,634 10,817 32,452 16,226 8,113 24,340 12,170 6,085 18,256 9,128 4,564

← Previous Integer #4,315,187 Browse Full Index Next Integer #4,315,189 →