4,020,006

2 × 3 × 670001

4,020,006 factors as 2 × 3 × 670001. Its 8 positive divisors give a proper-divisor sum of 4,020,018, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 670001

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,040,024

Proper Divisor Sum 4,020,018

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #4019993 ← → #4020011

Radix Representation

Decimal	4020006
Binary	1111010101011100100110 (22 bits)
Octal	0o17253446
Hexadecimal	0x3D5726

Divisor Catalog (8)

1 2 3 6 670,001 1,340,002 2,010,003 4,020,006

Collatz Trajectory (185 steps to reach 1)

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

4,020,006 2,010,003 6,030,010 3,015,005 9,045,016 4,522,508 2,261,254 1,130,627 3,391,882 1,695,941 5,087,824 2,543,912 1,271,956 635,978 317,989 953,968 476,984 238,492 119,246 59,623 178,870 89,435 268,306 134,153 402,460 201,230 100,615 301,846 150,923 452,770 226,385 679,156 339,578 169,789 509,368 254,684 127,342 63,671 191,014 95,507 286,522 143,261 429,784 214,892 107,446 53,723 161,170 80,585 241,756 120,878 60,439 181,318 90,659 271,978 135,989 407,968 203,984 101,992 50,996 25,498

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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