4,040,262

2 × 3² × 193 × 1163

4,040,262 factors as 2 × 3^2 × 193 × 1163. Its 24 positive divisors give a proper-divisor sum of 4,766,562, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 193 × 1163

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,806,824

Proper Divisor Sum 4,766,562

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #4040233 ← → #4040279

Radix Representation

Decimal	4040262
Binary	1111011010011001000110 (22 bits)
Octal	0o17323106
Hexadecimal	0x3DA646

Divisor Catalog (24)

Collatz Trajectory (185 steps to reach 1)

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

4,040,262 2,020,131 6,060,394 3,030,197 9,090,592 4,545,296 2,272,648 1,136,324 568,162 284,081 852,244 426,122 213,061 639,184 319,592 159,796 79,898 39,949 119,848 59,924 29,962 14,981 44,944 22,472 11,236 5,618 2,809 8,428 4,214 2,107 6,322 3,161 9,484 4,742 2,371 7,114 3,557 10,672 5,336 2,668 1,334 667 2,002 1,001 3,004 1,502 751 2,254 1,127 3,382 1,691 5,074 2,537 7,612 3,806 1,903 5,710 2,855 8,566 4,283

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,040,261 Browse Full Index Next Integer #4,040,263 →