1,209,286

2 × 13 × 46511

1,209,286 factors as 2 × 13 × 46511. Its 8 positive divisors give a proper-divisor sum of 744,218, so this integer is deficient. The Collatz stopping time is 160 steps.

Prime Factor Structure

Factorization String 2 × 13 × 46511

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,953,504

Proper Divisor Sum 744,218

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #1209281 ← → #1209287

Radix Representation

Decimal	1209286
Binary	100100111001111000110 (21 bits)
Octal	0o4471706
Hexadecimal	0x1273C6

Divisor Catalog (8)

1 2 13 26 46,511 93,022 604,643 1,209,286

Collatz Trajectory (160 steps to reach 1)

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

1,209,286 604,643 1,813,930 906,965 2,720,896 1,360,448 680,224 340,112 170,056 85,028 42,514 21,257 63,772 31,886 15,943 47,830 23,915 71,746 35,873 107,620 53,810 26,905 80,716 40,358 20,179 60,538 30,269 90,808 45,404 22,702 11,351 34,054 17,027 51,082 25,541 76,624 38,312 19,156 9,578 4,789 14,368 7,184 3,592 1,796 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286 143 430 215

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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