6,645,186

2 × 3³ × 123059

6,645,186 factors as 2 × 3^3 × 123059. Its 16 positive divisors give a proper-divisor sum of 8,122,014, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 123059

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 14,767,200

Proper Divisor Sum 8,122,014

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #6645169 ← → #6645187

Radix Representation

Decimal	6645186
Binary	11001010110010111000010 (23 bits)
Octal	0o31262702
Hexadecimal	0x6565C2

Divisor Catalog (16)

1 2 3 6 9 18 27 54 123,059 246,118 369,177 738,354 1,107,531 2,215,062 3,322,593 6,645,186

Collatz Trajectory (147 steps to reach 1)

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

6,645,186 3,322,593 9,967,780 4,983,890 2,491,945 7,475,836 3,737,918 1,868,959 5,606,878 2,803,439 8,410,318 4,205,159 12,615,478 6,307,739 18,923,218 9,461,609 28,384,828 14,192,414 7,096,207 21,288,622 10,644,311 31,932,934 15,966,467 47,899,402 23,949,701 71,849,104 35,924,552 17,962,276 8,981,138 4,490,569 13,471,708 6,735,854 3,367,927 10,103,782 5,051,891 15,155,674 7,577,837 22,733,512 11,366,756 5,683,378 2,841,689 8,525,068 4,262,534 2,131,267 6,393,802 3,196,901 9,590,704 4,795,352 2,397,676 1,198,838 599,419 1,798,258 899,129 2,697,388 1,348,694 674,347 2,023,042 1,011,521 3,034,564 1,517,282

← Previous Integer #6,645,185 Browse Full Index Next Integer #6,645,187 →