2,586,468

2² × 3 × 67 × 3217

2,586,468 factors as 2^2 × 3 × 67 × 3217. Its 24 positive divisors give a proper-divisor sum of 3,540,604, so this integer is abundant. The Collatz stopping time is 187 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 67 × 3217

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,127,072

Proper Divisor Sum 3,540,604

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2586443 ← → #2586497

Radix Representation

Decimal	2586468
Binary	1001110111011101100100 (22 bits)
Octal	0o11673544
Hexadecimal	0x277764

Divisor Catalog (24)

1 2 3 4 6 12 67 134 201 268 402 804 3,217 6,434 9,651 12,868 19,302 38,604 215,539 431,078 646,617 862,156 1,293,234 2,586,468

Collatz Trajectory (187 steps to reach 1)

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

2,586,468 1,293,234 646,617 1,939,852 969,926 484,963 1,454,890 727,445 2,182,336 1,091,168 545,584 272,792 136,396 68,198 34,099 102,298 51,149 153,448 76,724 38,362 19,181 57,544 28,772 14,386 7,193 21,580 10,790 5,395 16,186 8,093 24,280 12,140 6,070 3,035 9,106 4,553 13,660 6,830 3,415 10,246 5,123 15,370 7,685 23,056 11,528 5,764 2,882 1,441 4,324 2,162 1,081 3,244 1,622 811 2,434 1,217 3,652 1,826 913 2,740

← Previous Integer #2,586,467 Browse Full Index Next Integer #2,586,469 →