3,722,466

2 × 3 × 11 × 56401

3,722,466 factors as 2 × 3 × 11 × 56401. Its 16 positive divisors give a proper-divisor sum of 4,399,422, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 56401

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,121,888

Proper Divisor Sum 4,399,422

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3722443 ← → #3722479

Radix Representation

Decimal	3722466
Binary	1110001100110011100010 (22 bits)
Octal	0o16146342
Hexadecimal	0x38CCE2

Divisor Catalog (16)

1 2 3 6 11 22 33 66 56,401 112,802 169,203 338,406 620,411 1,240,822 1,861,233 3,722,466

Collatz Trajectory (79 steps to reach 1)

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

3,722,466 1,861,233 5,583,700 2,791,850 1,395,925 4,187,776 2,093,888 1,046,944 523,472 261,736 130,868 65,434 32,717 98,152 49,076 24,538 12,269 36,808 18,404 9,202 4,601 13,804 6,902 3,451 10,354 5,177 15,532 7,766 3,883 11,650 5,825 17,476 8,738 4,369 13,108 6,554 3,277 9,832 4,916 2,458 1,229 3,688 1,844 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112

← Previous Integer #3,722,465 Browse Full Index Next Integer #3,722,467 →