3,655,164

2² × 3 × 304597

3,655,164 factors as 2^2 × 3 × 304597. Its 12 positive divisors give a proper-divisor sum of 4,873,580, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 304597

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,528,744

Proper Divisor Sum 4,873,580

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3655159 ← → #3655199

Radix Representation

Decimal	3655164
Binary	1101111100010111111100 (22 bits)
Octal	0o15742774
Hexadecimal	0x37C5FC

Divisor Catalog (12)

1 2 3 4 6 12 304,597 609,194 913,791 1,218,388 1,827,582 3,655,164

Collatz Trajectory (97 steps to reach 1)

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

3,655,164 1,827,582 913,791 2,741,374 1,370,687 4,112,062 2,056,031 6,168,094 3,084,047 9,252,142 4,626,071 13,878,214 6,939,107 20,817,322 10,408,661 31,225,984 15,612,992 7,806,496 3,903,248 1,951,624 975,812 487,906 243,953 731,860 365,930 182,965 548,896 274,448 137,224 68,612 34,306 17,153 51,460 25,730 12,865 38,596 19,298 9,649 28,948 14,474 7,237 21,712 10,856 5,428 2,714 1,357 4,072 2,036 1,018 509 1,528 764 382 191 574 287 862 431 1,294 647

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,655,163 Browse Full Index Next Integer #3,655,165 →