1,089,486

2 × 3² × 60527

1,089,486 factors as 2 × 3^2 × 60527. Its 12 positive divisors give a proper-divisor sum of 1,271,106, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 60527

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,360,592

Proper Divisor Sum 1,271,106

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #1089481 ← → #1089497

Radix Representation

Decimal	1089486
Binary	100001001111111001110 (21 bits)
Octal	0o4117716
Hexadecimal	0x109FCE

Divisor Catalog (12)

1 2 3 6 9 18 60,527 121,054 181,581 363,162 544,743 1,089,486

Collatz Trajectory (165 steps to reach 1)

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

1,089,486 544,743 1,634,230 817,115 2,451,346 1,225,673 3,677,020 1,838,510 919,255 2,757,766 1,378,883 4,136,650 2,068,325 6,204,976 3,102,488 1,551,244 775,622 387,811 1,163,434 581,717 1,745,152 872,576 436,288 218,144 109,072 54,536 27,268 13,634 6,817 20,452 10,226 5,113 15,340 7,670 3,835 11,506 5,753 17,260 8,630 4,315 12,946 6,473 19,420 9,710 4,855 14,566 7,283 21,850 10,925 32,776 16,388 8,194 4,097 12,292 6,146 3,073 9,220 4,610 2,305 6,916

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,089,485 Browse Full Index Next Integer #1,089,487 →