3,019,980

2² × 3 × 5 × 50333

3,019,980 factors as 2^2 × 3 × 5 × 50333. Its 24 positive divisors give a proper-divisor sum of 5,436,132, so this integer is abundant. The Collatz stopping time is 94 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 50333

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,456,112

Proper Divisor Sum 5,436,132

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3019967 ← → #3019981

Radix Representation

Decimal	3019980
Binary	1011100001010011001100 (22 bits)
Octal	0o13412314
Hexadecimal	0x2E14CC

Divisor Catalog (24)

1 2 3 4 5 6 10 12 15 20 30 60 50,333 100,666 150,999 201,332 251,665 301,998 503,330 603,996 754,995 1,006,660 1,509,990 3,019,980

Collatz Trajectory (94 steps to reach 1)

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

3,019,980 1,509,990 754,995 2,264,986 1,132,493 3,397,480 1,698,740 849,370 424,685 1,274,056 637,028 318,514 159,257 477,772 238,886 119,443 358,330 179,165 537,496 268,748 134,374 67,187 201,562 100,781 302,344 151,172 75,586 37,793 113,380 56,690 28,345 85,036 42,518 21,259 63,778 31,889 95,668 47,834 23,917 71,752 35,876 17,938 8,969 26,908 13,454 6,727 20,182 10,091 30,274 15,137 45,412 22,706 11,353 34,060 17,030 8,515 25,546 12,773 38,320 19,160

← Previous Integer #3,019,979 Browse Full Index Next Integer #3,019,981 →