4,007,202

2 × 3 × 667867

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

Prime Factor Structure

Factorization String 2 × 3 × 667867

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,014,416

Proper Divisor Sum 4,007,214

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #4007183 ← → #4007207

Radix Representation

Decimal	4007202
Binary	1111010010010100100010 (22 bits)
Octal	0o17222442
Hexadecimal	0x3D2522

Divisor Catalog (8)

1 2 3 6 667,867 1,335,734 2,003,601 4,007,202

Collatz Trajectory (141 steps to reach 1)

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

4,007,202 2,003,601 6,010,804 3,005,402 1,502,701 4,508,104 2,254,052 1,127,026 563,513 1,690,540 845,270 422,635 1,267,906 633,953 1,901,860 950,930 475,465 1,426,396 713,198 356,599 1,069,798 534,899 1,604,698 802,349 2,407,048 1,203,524 601,762 300,881 902,644 451,322 225,661 676,984 338,492 169,246 84,623 253,870 126,935 380,806 190,403 571,210 285,605 856,816 428,408 214,204 107,102 53,551 160,654 80,327 240,982 120,491 361,474 180,737 542,212 271,106 135,553 406,660 203,330 101,665 304,996 152,498

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