3,695,960

2³ × 5 × 92399

3,695,960 factors as 2^3 × 5 × 92399. Its 16 positive divisors give a proper-divisor sum of 4,620,040, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 92399

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,316,000

Proper Divisor Sum 4,620,040

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #3695957 ← → #3695969

Radix Representation

Decimal	3695960
Binary	1110000110010101011000 (22 bits)
Octal	0o16062530
Hexadecimal	0x386558

Divisor Catalog (16)

1 2 4 5 8 10 20 40 92,399 184,798 369,596 461,995 739,192 923,990 1,847,980 3,695,960

Collatz Trajectory (172 steps to reach 1)

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

3,695,960 1,847,980 923,990 461,995 1,385,986 692,993 2,078,980 1,039,490 519,745 1,559,236 779,618 389,809 1,169,428 584,714 292,357 877,072 438,536 219,268 109,634 54,817 164,452 82,226 41,113 123,340 61,670 30,835 92,506 46,253 138,760 69,380 34,690 17,345 52,036 26,018 13,009 39,028 19,514 9,757 29,272 14,636 7,318 3,659 10,978 5,489 16,468 8,234 4,117 12,352 6,176 3,088 1,544 772 386 193 580 290 145 436 218 109

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,695,959 Browse Full Index Next Integer #3,695,961 →