5,965,836

2² × 3 × 497153

5,965,836 factors as 2^2 × 3 × 497153. Its 12 positive divisors give a proper-divisor sum of 7,954,476, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 497153

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,920,312

Proper Divisor Sum 7,954,476

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5965831 ← → #5965847

Radix Representation

Decimal	5965836
Binary	10110110000100000001100 (23 bits)
Octal	0o26604014
Hexadecimal	0x5B080C

Divisor Catalog (12)

1 2 3 4 6 12 497,153 994,306 1,491,459 1,988,612 2,982,918 5,965,836

Collatz Trajectory (121 steps to reach 1)

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

5,965,836 2,982,918 1,491,459 4,474,378 2,237,189 6,711,568 3,355,784 1,677,892 838,946 419,473 1,258,420 629,210 314,605 943,816 471,908 235,954 117,977 353,932 176,966 88,483 265,450 132,725 398,176 199,088 99,544 49,772 24,886 12,443 37,330 18,665 55,996 27,998 13,999 41,998 20,999 62,998 31,499 94,498 47,249 141,748 70,874 35,437 106,312 53,156 26,578 13,289 39,868 19,934 9,967 29,902 14,951 44,854 22,427 67,282 33,641 100,924 50,462 25,231 75,694 37,847

← Previous Integer #5,965,835 Browse Full Index Next Integer #5,965,837 →