3,698,060

2² × 5 × 184903

3,698,060 factors as 2^2 × 5 × 184903. Its 12 positive divisors give a proper-divisor sum of 4,067,908, so this integer is abundant. The Collatz stopping time is 110 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 184903

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,765,968

Proper Divisor Sum 4,067,908

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #3698053 ← → #3698063

Radix Representation

Decimal	3698060
Binary	1110000110110110001100 (22 bits)
Octal	0o16066614
Hexadecimal	0x386D8C

Divisor Catalog (12)

1 2 4 5 10 20 184,903 369,806 739,612 924,515 1,849,030 3,698,060

Collatz Trajectory (110 steps to reach 1)

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

3,698,060 1,849,030 924,515 2,773,546 1,386,773 4,160,320 2,080,160 1,040,080 520,040 260,020 130,010 65,005 195,016 97,508 48,754 24,377 73,132 36,566 18,283 54,850 27,425 82,276 41,138 20,569 61,708 30,854 15,427 46,282 23,141 69,424 34,712 17,356 8,678 4,339 13,018 6,509 19,528 9,764 4,882 2,441 7,324 3,662 1,831 5,494 2,747 8,242 4,121 12,364 6,182 3,091 9,274 4,637 13,912 6,956 3,478 1,739 5,218 2,609 7,828 3,914

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,698,059 Browse Full Index Next Integer #3,698,061 →