6,089,334

2 × 3 × 1014889

6,089,334 factors as 2 × 3 × 1014889. Its 8 positive divisors give a proper-divisor sum of 6,089,346, so this integer is abundant. The Collatz stopping time is 227 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1014889

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,178,680

Proper Divisor Sum 6,089,346

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6089309 ← → #6089341

Radix Representation

Decimal	6089334
Binary	10111001110101001110110 (23 bits)
Octal	0o27165166
Hexadecimal	0x5CEA76

Divisor Catalog (8)

1 2 3 6 1,014,889 2,029,778 3,044,667 6,089,334

Collatz Trajectory (227 steps to reach 1)

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

6,089,334 3,044,667 9,134,002 4,567,001 13,701,004 6,850,502 3,425,251 10,275,754 5,137,877 15,413,632 7,706,816 3,853,408 1,926,704 963,352 481,676 240,838 120,419 361,258 180,629 541,888 270,944 135,472 67,736 33,868 16,934 8,467 25,402 12,701 38,104 19,052 9,526 4,763 14,290 7,145 21,436 10,718 5,359 16,078 8,039 24,118 12,059 36,178 18,089 54,268 27,134 13,567 40,702 20,351 61,054 30,527 91,582 45,791 137,374 68,687 206,062 103,031 309,094 154,547 463,642 231,821

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,089,333 Browse Full Index Next Integer #6,089,335 →