3,695,982

2 × 3 × 615997

3,695,982 factors as 2 × 3 × 615997. Its 8 positive divisors give a proper-divisor sum of 3,695,994, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2 × 3 × 615997

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,391,976

Proper Divisor Sum 3,695,994

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #3695981 ← → #3695983

Radix Representation

Decimal	3695982
Binary	1110000110010101101110 (22 bits)
Octal	0o16062556
Hexadecimal	0x38656E

Divisor Catalog (8)

1 2 3 6 615,997 1,231,994 1,847,991 3,695,982

Collatz Trajectory (172 steps to reach 1)

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

3,695,982 1,847,991 5,543,974 2,771,987 8,315,962 4,157,981 12,473,944 6,236,972 3,118,486 1,559,243 4,677,730 2,338,865 7,016,596 3,508,298 1,754,149 5,262,448 2,631,224 1,315,612 657,806 328,903 986,710 493,355 1,480,066 740,033 2,220,100 1,110,050 555,025 1,665,076 832,538 416,269 1,248,808 624,404 312,202 156,101 468,304 234,152 117,076 58,538 29,269 87,808 43,904 21,952 10,976 5,488 2,744 1,372 686 343 1,030 515 1,546 773 2,320 1,160 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,981 Browse Full Index Next Integer #3,695,983 →