4,632,654

2 × 3 × 13 × 59393

4,632,654 factors as 2 × 3 × 13 × 59393. Its 16 positive divisors give a proper-divisor sum of 5,345,538, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 59393

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,978,192

Proper Divisor Sum 5,345,538

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4632647 ← → #4632673

Radix Representation

Decimal	4632654
Binary	10001101011000001001110 (23 bits)
Octal	0o21530116
Hexadecimal	0x46B04E

Divisor Catalog (16)

1 2 3 6 13 26 39 78 59,393 118,786 178,179 356,358 772,109 1,544,218 2,316,327 4,632,654

Collatz Trajectory (193 steps to reach 1)

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

4,632,654 2,316,327 6,948,982 3,474,491 10,423,474 5,211,737 15,635,212 7,817,606 3,908,803 11,726,410 5,863,205 17,589,616 8,794,808 4,397,404 2,198,702 1,099,351 3,298,054 1,649,027 4,947,082 2,473,541 7,420,624 3,710,312 1,855,156 927,578 463,789 1,391,368 695,684 347,842 173,921 521,764 260,882 130,441 391,324 195,662 97,831 293,494 146,747 440,242 220,121 660,364 330,182 165,091 495,274 247,637 742,912 371,456 185,728 92,864 46,432 23,216 11,608 5,804 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900

← Previous Integer #4,632,653 Browse Full Index Next Integer #4,632,655 →