4,930,680

2³ × 3 × 5 × 17 × 2417

4,930,680 factors as 2^3 × 3 × 5 × 17 × 2417. Its 64 positive divisors give a proper-divisor sum of 10,737,960, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 17 × 2417

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 15,668,640

Proper Divisor Sum 10,737,960

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4930649 ← → #4930693

Radix Representation

Decimal	4930680
Binary	10010110011110001111000 (23 bits)
Octal	0o22636170
Hexadecimal	0x4B3C78

Divisor Catalog (60 of 64)

1 2 3 4 5 6 8 10 12 15 17 20 24 30 34 40 51 60 68 85 102 120 136 170 204 255 340 408 510 680 1,020 2,040 2,417 4,834 7,251 9,668 12,085 14,502 19,336 24,170 29,004 36,255 41,089 48,340 58,008 72,510 82,178 96,680 123,267 145,020 164,356 205,445 246,534 290,040 328,712 410,890 493,068 616,335 821,780 986,136

Collatz Trajectory (193 steps to reach 1)

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

4,930,680 2,465,340 1,232,670 616,335 1,849,006 924,503 2,773,510 1,386,755 4,160,266 2,080,133 6,240,400 3,120,200 1,560,100 780,050 390,025 1,170,076 585,038 292,519 877,558 438,779 1,316,338 658,169 1,974,508 987,254 493,627 1,480,882 740,441 2,221,324 1,110,662 555,331 1,665,994 832,997 2,498,992 1,249,496 624,748 312,374 156,187 468,562 234,281 702,844 351,422 175,711 527,134 263,567 790,702 395,351 1,186,054 593,027 1,779,082 889,541 2,668,624 1,334,312 667,156 333,578 166,789 500,368 250,184 125,092 62,546 31,273

← Previous Integer #4,930,679 Browse Full Index Next Integer #4,930,681 →