32,003,132

2² × 7 × 1142969

32,003,132 factors as 2^2 × 7 × 1142969. Its 12 positive divisors give a proper-divisor sum of 32,003,188, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 1142969

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 64,006,320

Proper Divisor Sum 32,003,188

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #32003131 ← → #32003161

Radix Representation

Decimal	32003132
Binary	1111010000101010000111100 (25 bits)
Octal	0o172052074
Hexadecimal	0x1E8543C

Divisor Catalog (12)

1 2 4 7 14 28 1,142,969 2,285,938 4,571,876 8,000,783 16,001,566 32,003,132

Collatz Trajectory (157 steps to reach 1)

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

32,003,132 16,001,566 8,000,783 24,002,350 12,001,175 36,003,526 18,001,763 54,005,290 27,002,645 81,007,936 40,503,968 20,251,984 10,125,992 5,062,996 2,531,498 1,265,749 3,797,248 1,898,624 949,312 474,656 237,328 118,664 59,332 29,666 14,833 44,500 22,250 11,125 33,376 16,688 8,344 4,172 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #32,003,131 Browse Full Index Next Integer #32,003,133 →