3,642,005

5 × 61 × 11941

3,642,005 factors as 5 × 61 × 11941. Its 8 positive divisors give a proper-divisor sum of 800,419, so this integer is deficient. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 5 × 61 × 11941

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,442,424

Proper Divisor Sum 800,419

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #3641999 ← → #3642019

Radix Representation

Decimal	3642005
Binary	1101111001001010010101 (22 bits)
Octal	0o15711225
Hexadecimal	0x379295

Divisor Catalog (8)

1 5 61 305 11,941 59,705 728,401 3,642,005

Collatz Trajectory (97 steps to reach 1)

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

3,642,005 10,926,016 5,463,008 2,731,504 1,365,752 682,876 341,438 170,719 512,158 256,079 768,238 384,119 1,152,358 576,179 1,728,538 864,269 2,592,808 1,296,404 648,202 324,101 972,304 486,152 243,076 121,538 60,769 182,308 91,154 45,577 136,732 68,366 34,183 102,550 51,275 153,826 76,913 230,740 115,370 57,685 173,056 86,528 43,264 21,632 10,816 5,408 2,704 1,352 676 338 169 508 254 127 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,642,004 Browse Full Index Next Integer #3,642,006 →