1,034,832

2⁴ × 3 × 21559

1,034,832 factors as 2^4 × 3 × 21559. Its 20 positive divisors give a proper-divisor sum of 1,638,608, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 21559

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 2,673,440

Proper Divisor Sum 1,638,608

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1034827 ← → #1034833

Radix Representation

Decimal	1034832
Binary	11111100101001010000 (20 bits)
Octal	0o3745120
Hexadecimal	0xFCA50

Divisor Catalog (20)

1 2 3 4 6 8 12 16 24 48 21,559 43,118 64,677 86,236 129,354 172,472 258,708 344,944 517,416 1,034,832

Collatz Trajectory (152 steps to reach 1)

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

1,034,832 517,416 258,708 129,354 64,677 194,032 97,016 48,508 24,254 12,127 36,382 18,191 54,574 27,287 81,862 40,931 122,794 61,397 184,192 92,096 46,048 23,024 11,512 5,756 2,878 1,439 4,318 2,159 6,478 3,239 9,718 4,859 14,578 7,289 21,868 10,934 5,467 16,402 8,201 24,604 12,302 6,151 18,454 9,227 27,682 13,841 41,524 20,762 10,381 31,144 15,572 7,786 3,893 11,680 5,840 2,920 1,460 730 365 1,096

← Previous Integer #1,034,831 Browse Full Index Next Integer #1,034,833 →