2,485,956

2² × 3 × 11 × 37 × 509

2,485,956 factors as 2^2 × 3 × 11 × 37 × 509. Its 48 positive divisors give a proper-divisor sum of 4,025,724, so this integer is abundant. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 37 × 509

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,511,680

Proper Divisor Sum 4,025,724

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2485949 ← → #2485991

Radix Representation

Decimal	2485956
Binary	1001011110111011000100 (22 bits)
Octal	0o11367304
Hexadecimal	0x25EEC4

Divisor Catalog (48)

1 2 3 4 6 11 12 22 33 37 44 66 74 111 132 148 222 407 444 509 814 1,018 1,221 1,527 1,628 2,036 2,442 3,054 4,884 5,599 6,108 11,198 16,797 18,833 22,396 33,594 37,666 56,499 67,188 75,332 112,998 207,163 225,996 414,326 621,489 828,652 1,242,978 2,485,956

Collatz Trajectory (68 steps to reach 1)

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

2,485,956 1,242,978 621,489 1,864,468 932,234 466,117 1,398,352 699,176 349,588 174,794 87,397 262,192 131,096 65,548 32,774 16,387 49,162 24,581 73,744 36,872 18,436 9,218 4,609 13,828 6,914 3,457 10,372 5,186 2,593 7,780 3,890 1,945 5,836 2,918 1,459 4,378 2,189 6,568 3,284 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29 88 44 22 11 34 17 52 26 13

← Previous Integer #2,485,955 Browse Full Index Next Integer #2,485,957 →