3,676,770

2 × 3² × 5 × 40853

3,676,770 factors as 2 × 3^2 × 5 × 40853. Its 24 positive divisors give a proper-divisor sum of 5,883,066, so this integer is abundant. The Collatz stopping time is 265 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 40853

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,559,836

Proper Divisor Sum 5,883,066

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3676753 ← → #3676781

Radix Representation

Decimal	3676770
Binary	1110000001101001100010 (22 bits)
Octal	0o16015142
Hexadecimal	0x381A62

Divisor Catalog (24)

Collatz Trajectory (265 steps to reach 1)

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

3,676,770 1,838,385 5,515,156 2,757,578 1,378,789 4,136,368 2,068,184 1,034,092 517,046 258,523 775,570 387,785 1,163,356 581,678 290,839 872,518 436,259 1,308,778 654,389 1,963,168 981,584 490,792 245,396 122,698 61,349 184,048 92,024 46,012 23,006 11,503 34,510 17,255 51,766 25,883 77,650 38,825 116,476 58,238 29,119 87,358 43,679 131,038 65,519 196,558 98,279 294,838 147,419 442,258 221,129 663,388 331,694 165,847 497,542 248,771 746,314 373,157 1,119,472 559,736 279,868 139,934

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,676,769 Browse Full Index Next Integer #3,676,771 →