250,368

2⁹ × 3 × 163

250,368 factors as 2^9 × 3 × 163. Its 40 positive divisors give a proper-divisor sum of 420,720, so this integer is abundant. The Collatz stopping time is 57 steps.

Prime Factor Structure

Factorization String 2^9 × 3 × 163

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 671,088

Proper Divisor Sum 420,720

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #250361 ← → #250403

Radix Representation

Decimal	250368
Binary	111101001000000000 (18 bits)
Octal	0o751000
Hexadecimal	0x3D200

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 32 48 64 96 128 163 192 256 326 384 489 512 652 768 978 1,304 1,536 1,956 2,608 3,912 5,216 7,824 10,432 15,648 20,864 31,296 41,728 62,592 83,456 125,184 250,368

Collatz Trajectory (57 steps to reach 1)

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

250,368 125,184 62,592 31,296 15,648 7,824 3,912 1,956 978 489 1,468 734 367 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #250,367 Browse Full Index Next Integer #250,369 →