4,200,486

2 × 3 × 700081

4,200,486 factors as 2 × 3 × 700081. Its 8 positive divisors give a proper-divisor sum of 4,200,498, so this integer is abundant. The Collatz stopping time is 242 steps.

Prime Factor Structure

Factorization String 2 × 3 × 700081

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,400,984

Proper Divisor Sum 4,200,498

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4200481 ← → #4200487

Radix Representation

Decimal	4200486
Binary	10000000001100000100110 (23 bits)
Octal	0o20014046
Hexadecimal	0x401826

Divisor Catalog (8)

1 2 3 6 700,081 1,400,162 2,100,243 4,200,486

Collatz Trajectory (242 steps to reach 1)

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

4,200,486 2,100,243 6,300,730 3,150,365 9,451,096 4,725,548 2,362,774 1,181,387 3,544,162 1,772,081 5,316,244 2,658,122 1,329,061 3,987,184 1,993,592 996,796 498,398 249,199 747,598 373,799 1,121,398 560,699 1,682,098 841,049 2,523,148 1,261,574 630,787 1,892,362 946,181 2,838,544 1,419,272 709,636 354,818 177,409 532,228 266,114 133,057 399,172 199,586 99,793 299,380 149,690 74,845 224,536 112,268 56,134 28,067 84,202 42,101 126,304 63,152 31,576 15,788 7,894 3,947 11,842 5,921 17,764 8,882 4,441

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,200,485 Browse Full Index Next Integer #4,200,487 →