4,940,660

2² × 5 × 53 × 59 × 79

4,940,660 factors as 2^2 × 5 × 53 × 59 × 79. Its 48 positive divisors give a proper-divisor sum of 5,945,740, so this integer is abundant. The Collatz stopping time is 281 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 53 × 59 × 79

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 10,886,400

Proper Divisor Sum 5,945,740

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #4940651 ← → #4940669

Radix Representation

Decimal	4940660
Binary	10010110110001101110100 (23 bits)
Octal	0o22661564
Hexadecimal	0x4B6374

Divisor Catalog (48)

1 2 4 5 10 20 53 59 79 106 118 158 212 236 265 295 316 395 530 590 790 1,060 1,180 1,580 3,127 4,187 4,661 6,254 8,374 9,322 12,508 15,635 16,748 18,644 20,935 23,305 31,270 41,870 46,610 62,540 83,740 93,220 247,033 494,066 988,132 1,235,165 2,470,330 4,940,660

Collatz Trajectory (281 steps to reach 1)

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

4,940,660 2,470,330 1,235,165 3,705,496 1,852,748 926,374 463,187 1,389,562 694,781 2,084,344 1,042,172 521,086 260,543 781,630 390,815 1,172,446 586,223 1,758,670 879,335 2,638,006 1,319,003 3,957,010 1,978,505 5,935,516 2,967,758 1,483,879 4,451,638 2,225,819 6,677,458 3,338,729 10,016,188 5,008,094 2,504,047 7,512,142 3,756,071 11,268,214 5,634,107 16,902,322 8,451,161 25,353,484 12,676,742 6,338,371 19,015,114 9,507,557 28,522,672 14,261,336 7,130,668 3,565,334 1,782,667 5,348,002 2,674,001 8,022,004 4,011,002 2,005,501 6,016,504 3,008,252 1,504,126 752,063 2,256,190 1,128,095

← Previous Integer #4,940,659 Browse Full Index Next Integer #4,940,661 →