1,272,234

2 × 3 × 212039

1,272,234 factors as 2 × 3 × 212039. Its 8 positive divisors give a proper-divisor sum of 1,272,246, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3 × 212039

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,544,480

Proper Divisor Sum 1,272,246

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1272233 ← → #1272247

Radix Representation

Decimal	1272234
Binary	100110110100110101010 (21 bits)
Octal	0o4664652
Hexadecimal	0x1369AA

Divisor Catalog (8)

1 2 3 6 212,039 424,078 636,117 1,272,234

Collatz Trajectory (80 steps to reach 1)

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

1,272,234 636,117 1,908,352 954,176 477,088 238,544 119,272 59,636 29,818 14,909 44,728 22,364 11,182 5,591 16,774 8,387 25,162 12,581 37,744 18,872 9,436 4,718 2,359 7,078 3,539 10,618 5,309 15,928 7,964 3,982 1,991 5,974 2,987 8,962 4,481 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256 2,128 1,064 532 266 133 400 200 100 50 25 76 38

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,272,233 Browse Full Index Next Integer #1,272,235 →