6,065,322

2 × 3 × 43 × 23509

6,065,322 factors as 2 × 3 × 43 × 23509. Its 16 positive divisors give a proper-divisor sum of 6,347,958, so this integer is abundant. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2 × 3 × 43 × 23509

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,413,280

Proper Divisor Sum 6,347,958

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #6065287 ← → #6065329

Radix Representation

Decimal	6065322
Binary	10111001000110010101010 (23 bits)
Octal	0o27106252
Hexadecimal	0x5C8CAA

Divisor Catalog (16)

1 2 3 6 43 86 129 258 23,509 47,018 70,527 141,054 1,010,887 2,021,774 3,032,661 6,065,322

Collatz Trajectory (82 steps to reach 1)

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

6,065,322 3,032,661 9,097,984 4,548,992 2,274,496 1,137,248 568,624 284,312 142,156 71,078 35,539 106,618 53,309 159,928 79,964 39,982 19,991 59,974 29,987 89,962 44,981 134,944 67,472 33,736 16,868 8,434 4,217 12,652 6,326 3,163 9,490 4,745 14,236 7,118 3,559 10,678 5,339 16,018 8,009 24,028 12,014 6,007 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070

← Previous Integer #6,065,321 Browse Full Index Next Integer #6,065,323 →