3,628,230

2 × 3 × 5 × 120941

3,628,230 factors as 2 × 3 × 5 × 120941. Its 16 positive divisors give a proper-divisor sum of 5,079,594, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 120941

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,707,824

Proper Divisor Sum 5,079,594

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3628201 ← → #3628243

Radix Representation

Decimal	3628230
Binary	1101110101110011000110 (22 bits)
Octal	0o15656306
Hexadecimal	0x375CC6

Divisor Catalog (16)

1 2 3 5 6 10 15 30 120,941 241,882 362,823 604,705 725,646 1,209,410 1,814,115 3,628,230

Collatz Trajectory (66 steps to reach 1)

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

3,628,230 1,814,115 5,442,346 2,721,173 8,163,520 4,081,760 2,040,880 1,020,440 510,220 255,110 127,555 382,666 191,333 574,000 287,000 143,500 71,750 35,875 107,626 53,813 161,440 80,720 40,360 20,180 10,090 5,045 15,136 7,568 3,784 1,892 946 473 1,420 710 355 1,066 533 1,600 800 400 200 100 50 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20

← Previous Integer #3,628,229 Browse Full Index Next Integer #3,628,231 →