6,089,172

2² × 3 × 507431

6,089,172 factors as 2^2 × 3 × 507431. Its 12 positive divisors give a proper-divisor sum of 8,118,924, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 507431

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,208,096

Proper Divisor Sum 8,118,924

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6089147 ← → #6089207

Radix Representation

Decimal	6089172
Binary	10111001110100111010100 (23 bits)
Octal	0o27164724
Hexadecimal	0x5CE9D4

Divisor Catalog (12)

1 2 3 4 6 12 507,431 1,014,862 1,522,293 2,029,724 3,044,586 6,089,172

Collatz Trajectory (108 steps to reach 1)

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

6,089,172 3,044,586 1,522,293 4,566,880 2,283,440 1,141,720 570,860 285,430 142,715 428,146 214,073 642,220 321,110 160,555 481,666 240,833 722,500 361,250 180,625 541,876 270,938 135,469 406,408 203,204 101,602 50,801 152,404 76,202 38,101 114,304 57,152 28,576 14,288 7,144 3,572 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,089,171 Browse Full Index Next Integer #6,089,173 →