4,124,202

2 × 3 × 643 × 1069

4,124,202 factors as 2 × 3 × 643 × 1069. Its 16 positive divisors give a proper-divisor sum of 4,144,758, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2 × 3 × 643 × 1069

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,268,960

Proper Divisor Sum 4,144,758

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #4124191 ← → #4124207

Radix Representation

Decimal	4124202
Binary	1111101110111000101010 (22 bits)
Octal	0o17567052
Hexadecimal	0x3EEE2A

Divisor Catalog (16)

1 2 3 6 643 1,069 1,286 1,929 2,138 3,207 3,858 6,414 687,367 1,374,734 2,062,101 4,124,202

Collatz Trajectory (79 steps to reach 1)

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

4,124,202 2,062,101 6,186,304 3,093,152 1,546,576 773,288 386,644 193,322 96,661 289,984 144,992 72,496 36,248 18,124 9,062 4,531 13,594 6,797 20,392 10,196 5,098 2,549 7,648 3,824 1,912 956 478 239 718 359 1,078 539 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102 2,051 6,154 3,077 9,232 4,616 2,308 1,154 577 1,732 866 433 1,300 650 325 976 488 244 122

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,124,201 Browse Full Index Next Integer #4,124,203 →