3,084,970

2 × 5 × 7 × 44071

3,084,970 factors as 2 × 5 × 7 × 44071. Its 16 positive divisors give a proper-divisor sum of 3,261,398, so this integer is abundant. The Collatz stopping time is 102 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 44071

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,346,368

Proper Divisor Sum 3,261,398

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3084947 ← → #3084979

Radix Representation

Decimal	3084970
Binary	1011110001001010101010 (22 bits)
Octal	0o13611252
Hexadecimal	0x2F12AA

Divisor Catalog (16)

1 2 5 7 10 14 35 70 44,071 88,142 220,355 308,497 440,710 616,994 1,542,485 3,084,970

Collatz Trajectory (102 steps to reach 1)

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

3,084,970 1,542,485 4,627,456 2,313,728 1,156,864 578,432 289,216 144,608 72,304 36,152 18,076 9,038 4,519 13,558 6,779 20,338 10,169 30,508 15,254 7,627 22,882 11,441 34,324 17,162 8,581 25,744 12,872 6,436 3,218 1,609 4,828 2,414 1,207 3,622 1,811 5,434 2,717 8,152 4,076 2,038 1,019 3,058 1,529 4,588 2,294 1,147 3,442 1,721 5,164 2,582 1,291 3,874 1,937 5,812 2,906 1,453 4,360 2,180 1,090 545

← Previous Integer #3,084,969 Browse Full Index Next Integer #3,084,971 →