4,020,000

2⁵ × 3 × 5⁴ × 67

4,020,000 factors as 2^5 × 3 × 5^4 × 67. Its 120 positive divisors give a proper-divisor sum of 9,363,216, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 5^4 × 67

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 120

Divisor Sum (σ) 13,383,216

Proper Divisor Sum 9,363,216

Digit Sum / Digital Root 6 (Root: 6)

Adjacent Primes #4019993 ← → #4020011

Radix Representation

Decimal	4020000
Binary	1111010101011100100000 (22 bits)
Octal	0o17253440
Hexadecimal	0x3D5720

Divisor Catalog (60 of 120)

1 2 3 4 5 6 8 10 12 15 16 20 24 25 30 32 40 48 50 60 67 75 80 96 100 120 125 134 150 160 200 201 240 250 268 300 335 375 400 402 480 500 536 600 625 670 750 800 804 1,000 1,005 1,072 1,200 1,250 1,340 1,500 1,608 1,675 1,875 2,000

Collatz Trajectory (92 steps to reach 1)

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

4,020,000 2,010,000 1,005,000 502,500 251,250 125,625 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,019,999 Browse Full Index Next Integer #4,020,001 →