1,257,366

2 × 3 × 11 × 19051

1,257,366 factors as 2 × 3 × 11 × 19051. Its 16 positive divisors give a proper-divisor sum of 1,486,122, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 19051

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,743,488

Proper Divisor Sum 1,486,122

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1257359 ← → #1257397

Radix Representation

Decimal	1257366
Binary	100110010111110010110 (21 bits)
Octal	0o4627626
Hexadecimal	0x132F96

Divisor Catalog (16)

1 2 3 6 11 22 33 66 19,051 38,102 57,153 114,306 209,561 419,122 628,683 1,257,366

Collatz Trajectory (129 steps to reach 1)

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

1,257,366 628,683 1,886,050 943,025 2,829,076 1,414,538 707,269 2,121,808 1,060,904 530,452 265,226 132,613 397,840 198,920 99,460 49,730 24,865 74,596 37,298 18,649 55,948 27,974 13,987 41,962 20,981 62,944 31,472 15,736 7,868 3,934 1,967 5,902 2,951 8,854 4,427 13,282 6,641 19,924 9,962 4,981 14,944 7,472 3,736 1,868 934 467 1,402 701 2,104 1,052 526 263 790 395 1,186 593 1,780 890 445 1,336

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,257,365 Browse Full Index Next Integer #1,257,367 →