1,440,918

2 × 3² × 80051

1,440,918 factors as 2 × 3^2 × 80051. Its 12 positive divisors give a proper-divisor sum of 1,681,110, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 80051

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,122,028

Proper Divisor Sum 1,681,110

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1440913 ← → #1440949

Radix Representation

Decimal	1440918
Binary	101011111110010010110 (21 bits)
Octal	0o5376226
Hexadecimal	0x15FC96

Divisor Catalog (12)

1 2 3 6 9 18 80,051 160,102 240,153 480,306 720,459 1,440,918

Collatz Trajectory (150 steps to reach 1)

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

1,440,918 720,459 2,161,378 1,080,689 3,242,068 1,621,034 810,517 2,431,552 1,215,776 607,888 303,944 151,972 75,986 37,993 113,980 56,990 28,495 85,486 42,743 128,230 64,115 192,346 96,173 288,520 144,260 72,130 36,065 108,196 54,098 27,049 81,148 40,574 20,287 60,862 30,431 91,294 45,647 136,942 68,471 205,414 102,707 308,122 154,061 462,184 231,092 115,546 57,773 173,320 86,660 43,330 21,665 64,996 32,498 16,249 48,748 24,374 12,187 36,562 18,281 54,844

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,440,917 Browse Full Index Next Integer #1,440,919 →