3,690,132

2² × 3 × 307511

3,690,132 factors as 2^2 × 3 × 307511. Its 12 positive divisors give a proper-divisor sum of 4,920,204, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 307511

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,610,336

Proper Divisor Sum 4,920,204

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3690119 ← → #3690149

Radix Representation

Decimal	3690132
Binary	1110000100111010010100 (22 bits)
Octal	0o16047224
Hexadecimal	0x384E94

Divisor Catalog (12)

1 2 3 4 6 12 307,511 615,022 922,533 1,230,044 1,845,066 3,690,132

Collatz Trajectory (79 steps to reach 1)

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

3,690,132 1,845,066 922,533 2,767,600 1,383,800 691,900 345,950 172,975 518,926 259,463 778,390 389,195 1,167,586 583,793 1,751,380 875,690 437,845 1,313,536 656,768 328,384 164,192 82,096 41,048 20,524 10,262 5,131 15,394 7,697 23,092 11,546 5,773 17,320 8,660 4,330 2,165 6,496 3,248 1,624 812 406 203 610 305 916 458 229 688 344 172 86 43 130 65 196 98 49 148 74 37 112

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,690,131 Browse Full Index Next Integer #3,690,133 →