4,870,740

2² × 3 × 5 × 7 × 11597

4,870,740 factors as 2^2 × 3 × 5 × 7 × 11597. Its 48 positive divisors give a proper-divisor sum of 10,716,972, so this integer is abundant. The Collatz stopping time is 206 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 7 × 11597

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 15,587,712

Proper Divisor Sum 10,716,972

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4870729 ← → #4870763

Radix Representation

Decimal	4870740
Binary	10010100101001001010100 (23 bits)
Octal	0o22451124
Hexadecimal	0x4A5254

Divisor Catalog (48)

1 2 3 4 5 6 7 10 12 14 15 20 21 28 30 35 42 60 70 84 105 140 210 420 11,597 23,194 34,791 46,388 57,985 69,582 81,179 115,970 139,164 162,358 173,955 231,940 243,537 324,716 347,910 405,895 487,074 695,820 811,790 974,148 1,217,685 1,623,580 2,435,370 4,870,740

Collatz Trajectory (206 steps to reach 1)

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

4,870,740 2,435,370 1,217,685 3,653,056 1,826,528 913,264 456,632 228,316 114,158 57,079 171,238 85,619 256,858 128,429 385,288 192,644 96,322 48,161 144,484 72,242 36,121 108,364 54,182 27,091 81,274 40,637 121,912 60,956 30,478 15,239 45,718 22,859 68,578 34,289 102,868 51,434 25,717 77,152 38,576 19,288 9,644 4,822 2,411 7,234 3,617 10,852 5,426 2,713 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859

← Previous Integer #4,870,739 Browse Full Index Next Integer #4,870,741 →