3,902,604

2² × 3 × 325217

3,902,604 factors as 2^2 × 3 × 325217. Its 12 positive divisors give a proper-divisor sum of 5,203,500, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 325217

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,106,104

Proper Divisor Sum 5,203,500

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3902579 ← → #3902609

Radix Representation

Decimal	3902604
Binary	1110111000110010001100 (22 bits)
Octal	0o16706214
Hexadecimal	0x3B8C8C

Divisor Catalog (12)

1 2 3 4 6 12 325,217 650,434 975,651 1,300,868 1,951,302 3,902,604

Collatz Trajectory (141 steps to reach 1)

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

3,902,604 1,951,302 975,651 2,926,954 1,463,477 4,390,432 2,195,216 1,097,608 548,804 274,402 137,201 411,604 205,802 102,901 308,704 154,352 77,176 38,588 19,294 9,647 28,942 14,471 43,414 21,707 65,122 32,561 97,684 48,842 24,421 73,264 36,632 18,316 9,158 4,579 13,738 6,869 20,608 10,304 5,152 2,576 1,288 644 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,902,603 Browse Full Index Next Integer #3,902,605 →