3,060,670

2 × 5 × 421 × 727

3,060,670 factors as 2 × 5 × 421 × 727. Its 16 positive divisors give a proper-divisor sum of 2,469,218, so this integer is deficient. The Collatz stopping time is 239 steps.

Prime Factor Structure

Factorization String 2 × 5 × 421 × 727

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,529,888

Proper Divisor Sum 2,469,218

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #3060667 ← → #3060683

Radix Representation

Decimal	3060670
Binary	1011101011001110111110 (22 bits)
Octal	0o13531676
Hexadecimal	0x2EB3BE

Divisor Catalog (16)

1 2 5 10 421 727 842 1,454 2,105 3,635 4,210 7,270 306,067 612,134 1,530,335 3,060,670

Collatz Trajectory (239 steps to reach 1)

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

3,060,670 1,530,335 4,591,006 2,295,503 6,886,510 3,443,255 10,329,766 5,164,883 15,494,650 7,747,325 23,241,976 11,620,988 5,810,494 2,905,247 8,715,742 4,357,871 13,073,614 6,536,807 19,610,422 9,805,211 29,415,634 14,707,817 44,123,452 22,061,726 11,030,863 33,092,590 16,546,295 49,638,886 24,819,443 74,458,330 37,229,165 111,687,496 55,843,748 27,921,874 13,960,937 41,882,812 20,941,406 10,470,703 31,412,110 15,706,055 47,118,166 23,559,083 70,677,250 35,338,625 106,015,876 53,007,938 26,503,969 79,511,908 39,755,954 19,877,977 59,633,932 29,816,966 14,908,483 44,725,450 22,362,725 67,088,176 33,544,088 16,772,044 8,386,022 4,193,011

← Previous Integer #3,060,669 Browse Full Index Next Integer #3,060,671 →