4,020,008

2³ × 502501

4,020,008 factors as 2^3 × 502501. Its 8 positive divisors give a proper-divisor sum of 3,517,522, so this integer is deficient. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^3 × 502501

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,537,530

Proper Divisor Sum 3,517,522

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #4019993 ← → #4020011

Radix Representation

Decimal	4020008
Binary	1111010101011100101000 (22 bits)
Octal	0o17253450
Hexadecimal	0x3D5728

Divisor Catalog (8)

1 2 4 8 502,501 1,005,002 2,010,004 4,020,008

Collatz Trajectory (92 steps to reach 1)

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

4,020,008 2,010,004 1,005,002 502,501 1,507,504 753,752 376,876 188,438 94,219 282,658 141,329 423,988 211,994 105,997 317,992 158,996 79,498 39,749 119,248 59,624 29,812 14,906 7,453 22,360 11,180 5,590 2,795 8,386 4,193 12,580 6,290 3,145 9,436 4,718 2,359 7,078 3,539 10,618 5,309 15,928 7,964 3,982 1,991 5,974 2,987 8,962 4,481 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256

← Previous Integer #4,020,007 Browse Full Index Next Integer #4,020,009 →