1,005,708

2² × 3 × 11 × 19 × 401

1,005,708 factors as 2^2 × 3 × 11 × 19 × 401. Its 48 positive divisors give a proper-divisor sum of 1,695,732, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 19 × 401

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 2,701,440

Proper Divisor Sum 1,695,732

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1005701 ← → #1005709

Radix Representation

Decimal	1005708
Binary	11110101100010001100 (20 bits)
Octal	0o3654214
Hexadecimal	0xF588C

Divisor Catalog (48)

1 2 3 4 6 11 12 19 22 33 38 44 57 66 76 114 132 209 228 401 418 627 802 836 1,203 1,254 1,604 2,406 2,508 4,411 4,812 7,619 8,822 13,233 15,238 17,644 22,857 26,466 30,476 45,714 52,932 83,809 91,428 167,618 251,427 335,236 502,854 1,005,708

Collatz Trajectory (90 steps to reach 1)

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

1,005,708 502,854 251,427 754,282 377,141 1,131,424 565,712 282,856 141,428 70,714 35,357 106,072 53,036 26,518 13,259 39,778 19,889 59,668 29,834 14,917 44,752 22,376 11,188 5,594 2,797 8,392 4,196 2,098 1,049 3,148 1,574 787 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179

← Previous Integer #1,005,707 Browse Full Index Next Integer #1,005,709 →