3,040,980

2² × 3 × 5 × 50683

3,040,980 factors as 2^2 × 3 × 5 × 50683. Its 24 positive divisors give a proper-divisor sum of 5,473,932, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 50683

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,514,912

Proper Divisor Sum 5,473,932

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3040979 ← → #3040987

Radix Representation

Decimal	3040980
Binary	1011100110011011010100 (22 bits)
Octal	0o13463324
Hexadecimal	0x2E66D4

Divisor Catalog (24)

Collatz Trajectory (81 steps to reach 1)

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

3,040,980 1,520,490 760,245 2,280,736 1,140,368 570,184 285,092 142,546 71,273 213,820 106,910 53,455 160,366 80,183 240,550 120,275 360,826 180,413 541,240 270,620 135,310 67,655 202,966 101,483 304,450 152,225 456,676 228,338 114,169 342,508 171,254 85,627 256,882 128,441 385,324 192,662 96,331 288,994 144,497 433,492 216,746 108,373 325,120 162,560 81,280 40,640 20,320 10,160 5,080 2,540 1,270 635 1,906 953 2,860 1,430 715 2,146 1,073 3,220

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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