6,089,646

2 × 3 × 1014941

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

Prime Factor Structure

Factorization String 2 × 3 × 1014941

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,179,304

Proper Divisor Sum 6,089,658

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6089639 ← → #6089651

Radix Representation

Decimal	6089646
Binary	10111001110101110101110 (23 bits)
Octal	0o27165656
Hexadecimal	0x5CEBAE

Divisor Catalog (8)

1 2 3 6 1,014,941 2,029,882 3,044,823 6,089,646

Collatz Trajectory (227 steps to reach 1)

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

6,089,646 3,044,823 9,134,470 4,567,235 13,701,706 6,850,853 20,552,560 10,276,280 5,138,140 2,569,070 1,284,535 3,853,606 1,926,803 5,780,410 2,890,205 8,670,616 4,335,308 2,167,654 1,083,827 3,251,482 1,625,741 4,877,224 2,438,612 1,219,306 609,653 1,828,960 914,480 457,240 228,620 114,310 57,155 171,466 85,733 257,200 128,600 64,300 32,150 16,075 48,226 24,113 72,340 36,170 18,085 54,256 27,128 13,564 6,782 3,391 10,174 5,087 15,262 7,631 22,894 11,447 34,342 17,171 51,514 25,757 77,272 38,636

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,089,645 Browse Full Index Next Integer #6,089,647 →