4,200,080

2⁴ × 5 × 52501

4,200,080 factors as 2^4 × 5 × 52501. Its 20 positive divisors give a proper-divisor sum of 5,565,292, so this integer is abundant. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 52501

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 9,765,372

Proper Divisor Sum 5,565,292

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #4200073 ← → #4200103

Radix Representation

Decimal	4200080
Binary	10000000001011010010000 (23 bits)
Octal	0o20013220
Hexadecimal	0x401690

Divisor Catalog (20)

1 2 4 5 8 10 16 20 40 80 52,501 105,002 210,004 262,505 420,008 525,010 840,016 1,050,020 2,100,040 4,200,080

Collatz Trajectory (128 steps to reach 1)

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

4,200,080 2,100,040 1,050,020 525,010 262,505 787,516 393,758 196,879 590,638 295,319 885,958 442,979 1,328,938 664,469 1,993,408 996,704 498,352 249,176 124,588 62,294 31,147 93,442 46,721 140,164 70,082 35,041 105,124 52,562 26,281 78,844 39,422 19,711 59,134 29,567 88,702 44,351 133,054 66,527 199,582 99,791 299,374 149,687 449,062 224,531 673,594 336,797 1,010,392 505,196 252,598 126,299 378,898 189,449 568,348 284,174 142,087 426,262 213,131 639,394 319,697 959,092

← Previous Integer #4,200,079 Browse Full Index Next Integer #4,200,081 →