1,409,286

2 × 3 × 193 × 1217

1,409,286 factors as 2 × 3 × 193 × 1217. Its 16 positive divisors give a proper-divisor sum of 1,426,218, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3 × 193 × 1217

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,835,504

Proper Divisor Sum 1,426,218

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1409263 ← → #1409299

Radix Representation

Decimal	1409286
Binary	101011000000100000110 (21 bits)
Octal	0o5300406
Hexadecimal	0x158106

Divisor Catalog (16)

1 2 3 6 193 386 579 1,158 1,217 2,434 3,651 7,302 234,881 469,762 704,643 1,409,286

Collatz Trajectory (80 steps to reach 1)

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

1,409,286 704,643 2,113,930 1,056,965 3,170,896 1,585,448 792,724 396,362 198,181 594,544 297,272 148,636 74,318 37,159 111,478 55,739 167,218 83,609 250,828 125,414 62,707 188,122 94,061 282,184 141,092 70,546 35,273 105,820 52,910 26,455 79,366 39,683 119,050 59,525 178,576 89,288 44,644 22,322 11,161 33,484 16,742 8,371 25,114 12,557 37,672 18,836 9,418 4,709 14,128 7,064 3,532 1,766 883 2,650 1,325 3,976 1,988 994 497 1,492

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,409,285 Browse Full Index Next Integer #1,409,287 →