4,808,580

2² × 3 × 5 × 7 × 107²

4,808,580 factors as 2^2 × 3 × 5 × 7 × 107^2. Its 72 positive divisors give a proper-divisor sum of 10,724,028, so this integer is abundant. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 7 × 107^2

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 15,532,608

Proper Divisor Sum 10,724,028

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4808579 ← → #4808593

Radix Representation

Decimal	4808580
Binary	10010010101111110000100 (23 bits)
Octal	0o22257604
Hexadecimal	0x495F84

Divisor Catalog (60 of 72)

1 2 3 4 5 6 7 10 12 14 15 20 21 28 30 35 42 60 70 84 105 107 140 210 214 321 420 428 535 642 749 1,070 1,284 1,498 1,605 2,140 2,247 2,996 3,210 3,745 4,494 6,420 7,490 8,988 11,235 11,449 14,980 22,470 22,898 34,347 44,940 45,796 57,245 68,694 80,143 114,490 137,388 160,286 171,735 228,980

Collatz Trajectory (118 steps to reach 1)

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

4,808,580 2,404,290 1,202,145 3,606,436 1,803,218 901,609 2,704,828 1,352,414 676,207 2,028,622 1,014,311 3,042,934 1,521,467 4,564,402 2,282,201 6,846,604 3,423,302 1,711,651 5,134,954 2,567,477 7,702,432 3,851,216 1,925,608 962,804 481,402 240,701 722,104 361,052 180,526 90,263 270,790 135,395 406,186 203,093 609,280 304,640 152,320 76,160 38,080 19,040 9,520 4,760 2,380 1,190 595 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850

← Previous Integer #4,808,579 Browse Full Index Next Integer #4,808,581 →