5,282,202

2 × 3 × 880367

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

Prime Factor Structure

Factorization String 2 × 3 × 880367

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,564,416

Proper Divisor Sum 5,282,214

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #5282159 ← → #5282219

Radix Representation

Decimal	5282202
Binary	10100001001100110011010 (23 bits)
Octal	0o24114632
Hexadecimal	0x50999A

Divisor Catalog (8)

1 2 3 6 880,367 1,760,734 2,641,101 5,282,202

Collatz Trajectory (188 steps to reach 1)

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

5,282,202 2,641,101 7,923,304 3,961,652 1,980,826 990,413 2,971,240 1,485,620 742,810 371,405 1,114,216 557,108 278,554 139,277 417,832 208,916 104,458 52,229 156,688 78,344 39,172 19,586 9,793 29,380 14,690 7,345 22,036 11,018 5,509 16,528 8,264 4,132 2,066 1,033 3,100 1,550 775 2,326 1,163 3,490 1,745 5,236 2,618 1,309 3,928 1,964 982 491 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,282,201 Browse Full Index Next Integer #5,282,203 →