4,098,050

2 × 5² × 11 × 7451

4,098,050 factors as 2 × 5^2 × 11 × 7451. Its 24 positive divisors give a proper-divisor sum of 4,218,382, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 11 × 7451

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,316,432

Proper Divisor Sum 4,218,382

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #4098043 ← → #4098079

Radix Representation

Decimal	4098050
Binary	1111101000100000000010 (22 bits)
Octal	0o17504002
Hexadecimal	0x3E8802

Divisor Catalog (24)

Collatz Trajectory (92 steps to reach 1)

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

4,098,050 2,049,025 6,147,076 3,073,538 1,536,769 4,610,308 2,305,154 1,152,577 3,457,732 1,728,866 864,433 2,593,300 1,296,650 648,325 1,944,976 972,488 486,244 243,122 121,561 364,684 182,342 91,171 273,514 136,757 410,272 205,136 102,568 51,284 25,642 12,821 38,464 19,232 9,616 4,808 2,404 1,202 601 1,804 902 451 1,354 677 2,032 1,016 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,098,049 Browse Full Index Next Integer #4,098,051 →