1,039,308

2² × 3 × 257 × 337

1,039,308 factors as 2^2 × 3 × 257 × 337. Its 24 positive divisors give a proper-divisor sum of 1,402,404, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 257 × 337

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 2,441,712

Proper Divisor Sum 1,402,404

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1039307 ← → #1039321

Radix Representation

Decimal	1039308
Binary	11111101101111001100 (20 bits)
Octal	0o3755714
Hexadecimal	0xFDBCC

Divisor Catalog (24)

1 2 3 4 6 12 257 337 514 674 771 1,011 1,028 1,348 1,542 2,022 3,084 4,044 86,609 173,218 259,827 346,436 519,654 1,039,308

Collatz Trajectory (165 steps to reach 1)

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

1,039,308 519,654 259,827 779,482 389,741 1,169,224 584,612 292,306 146,153 438,460 219,230 109,615 328,846 164,423 493,270 246,635 739,906 369,953 1,109,860 554,930 277,465 832,396 416,198 208,099 624,298 312,149 936,448 468,224 234,112 117,056 58,528 29,264 14,632 7,316 3,658 1,829 5,488 2,744 1,372 686 343 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31

← Previous Integer #1,039,307 Browse Full Index Next Integer #1,039,309 →