257,142

2 × 3 × 17 × 2521

257,142 factors as 2 × 3 × 17 × 2521. Its 16 positive divisors give a proper-divisor sum of 287,610, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 2521

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 544,752

Proper Divisor Sum 287,610

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #257141 ← → #257161

Radix Representation

Decimal	257142
Binary	111110110001110110 (18 bits)
Octal	0o766166
Hexadecimal	0x3EC76

Divisor Catalog (16)

1 2 3 6 17 34 51 102 2,521 5,042 7,563 15,126 42,857 85,714 128,571 257,142

Collatz Trajectory (132 steps to reach 1)

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

257,142 128,571 385,714 192,857 578,572 289,286 144,643 433,930 216,965 650,896 325,448 162,724 81,362 40,681 122,044 61,022 30,511 91,534 45,767 137,302 68,651 205,954 102,977 308,932 154,466 77,233 231,700 115,850 57,925 173,776 86,888 43,444 21,722 10,861 32,584 16,292 8,146 4,073 12,220 6,110 3,055 9,166 4,583 13,750 6,875 20,626 10,313 30,940 15,470 7,735 23,206 11,603 34,810 17,405 52,216 26,108 13,054 6,527 19,582 9,791

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #257,141 Browse Full Index Next Integer #257,143 →