5,032,002

2 × 3 × 838667

5,032,002 factors as 2 × 3 × 838667. Its 8 positive divisors give a proper-divisor sum of 5,032,014, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3 × 838667

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,064,016

Proper Divisor Sum 5,032,014

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #5031997 ← → #5032019

Radix Representation

Decimal	5032002
Binary	10011001100100001000010 (23 bits)
Octal	0o23144102
Hexadecimal	0x4CC842

Divisor Catalog (8)

1 2 3 6 838,667 1,677,334 2,516,001 5,032,002

Collatz Trajectory (131 steps to reach 1)

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

5,032,002 2,516,001 7,548,004 3,774,002 1,887,001 5,661,004 2,830,502 1,415,251 4,245,754 2,122,877 6,368,632 3,184,316 1,592,158 796,079 2,388,238 1,194,119 3,582,358 1,791,179 5,373,538 2,686,769 8,060,308 4,030,154 2,015,077 6,045,232 3,022,616 1,511,308 755,654 377,827 1,133,482 566,741 1,700,224 850,112 425,056 212,528 106,264 53,132 26,566 13,283 39,850 19,925 59,776 29,888 14,944 7,472 3,736 1,868 934 467 1,402 701 2,104 1,052 526 263 790 395 1,186 593 1,780 890

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,032,001 Browse Full Index Next Integer #5,032,003 →