6,328,074

2 × 3 × 1054679

6,328,074 factors as 2 × 3 × 1054679. Its 8 positive divisors give a proper-divisor sum of 6,328,086, so this integer is abundant. The Collatz stopping time is 103 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1054679

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,656,160

Proper Divisor Sum 6,328,086

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6328067 ← → #6328099

Radix Representation

Decimal	6328074
Binary	11000001000111100001010 (23 bits)
Octal	0o30107412
Hexadecimal	0x608F0A

Divisor Catalog (8)

1 2 3 6 1,054,679 2,109,358 3,164,037 6,328,074

Collatz Trajectory (103 steps to reach 1)

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

6,328,074 3,164,037 9,492,112 4,746,056 2,373,028 1,186,514 593,257 1,779,772 889,886 444,943 1,334,830 667,415 2,002,246 1,001,123 3,003,370 1,501,685 4,505,056 2,252,528 1,126,264 563,132 281,566 140,783 422,350 211,175 633,526 316,763 950,290 475,145 1,425,436 712,718 356,359 1,069,078 534,539 1,603,618 801,809 2,405,428 1,202,714 601,357 1,804,072 902,036 451,018 225,509 676,528 338,264 169,132 84,566 42,283 126,850 63,425 190,276 95,138 47,569 142,708 71,354 35,677 107,032 53,516 26,758 13,379 40,138

← Previous Integer #6,328,073 Browse Full Index Next Integer #6,328,075 →