1,405,686

2 × 3 × 234281

1,405,686 factors as 2 × 3 × 234281. Its 8 positive divisors give a proper-divisor sum of 1,405,698, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2 × 3 × 234281

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,811,384

Proper Divisor Sum 1,405,698

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1405681 ← → #1405693

Radix Representation

Decimal	1405686
Binary	101010111001011110110 (21 bits)
Octal	0o5271366
Hexadecimal	0x1572F6

Divisor Catalog (8)

1 2 3 6 234,281 468,562 702,843 1,405,686

Collatz Trajectory (155 steps to reach 1)

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

1,405,686 702,843 2,108,530 1,054,265 3,162,796 1,581,398 790,699 2,372,098 1,186,049 3,558,148 1,779,074 889,537 2,668,612 1,334,306 667,153 2,001,460 1,000,730 500,365 1,501,096 750,548 375,274 187,637 562,912 281,456 140,728 70,364 35,182 17,591 52,774 26,387 79,162 39,581 118,744 59,372 29,686 14,843 44,530 22,265 66,796 33,398 16,699 50,098 25,049 75,148 37,574 18,787 56,362 28,181 84,544 42,272 21,136 10,568 5,284 2,642 1,321 3,964 1,982 991 2,974 1,487

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,405,685 Browse Full Index Next Integer #1,405,687 →