2,702,202

2 × 3 × 450367

2,702,202 factors as 2 × 3 × 450367. Its 8 positive divisors give a proper-divisor sum of 2,702,214, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2 × 3 × 450367

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,404,416

Proper Divisor Sum 2,702,214

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #2702197 ← → #2702209

Radix Representation

Decimal	2702202
Binary	1010010011101101111010 (22 bits)
Octal	0o12235572
Hexadecimal	0x293B7A

Divisor Catalog (8)

1 2 3 6 450,367 900,734 1,351,101 2,702,202

Collatz Trajectory (86 steps to reach 1)

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

2,702,202 1,351,101 4,053,304 2,026,652 1,013,326 506,663 1,519,990 759,995 2,279,986 1,139,993 3,419,980 1,709,990 854,995 2,564,986 1,282,493 3,847,480 1,923,740 961,870 480,935 1,442,806 721,403 2,164,210 1,082,105 3,246,316 1,623,158 811,579 2,434,738 1,217,369 3,652,108 1,826,054 913,027 2,739,082 1,369,541 4,108,624 2,054,312 1,027,156 513,578 256,789 770,368 385,184 192,592 96,296 48,148 24,074 12,037 36,112 18,056 9,028 4,514 2,257 6,772 3,386 1,693 5,080 2,540 1,270 635 1,906 953 2,860

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,702,201 Browse Full Index Next Integer #2,702,203 →