2,526,258

2 × 3 × 7 × 60149

2,526,258 factors as 2 × 3 × 7 × 60149. Its 16 positive divisors give a proper-divisor sum of 3,248,142, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 60149

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,774,400

Proper Divisor Sum 3,248,142

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2526257 ← → #2526269

Radix Representation

Decimal	2526258
Binary	1001101000110000110010 (22 bits)
Octal	0o11506062
Hexadecimal	0x268C32

Divisor Catalog (16)

1 2 3 6 7 14 21 42 60,149 120,298 180,447 360,894 421,043 842,086 1,263,129 2,526,258

Collatz Trajectory (81 steps to reach 1)

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

2,526,258 1,263,129 3,789,388 1,894,694 947,347 2,842,042 1,421,021 4,263,064 2,131,532 1,065,766 532,883 1,598,650 799,325 2,397,976 1,198,988 599,494 299,747 899,242 449,621 1,348,864 674,432 337,216 168,608 84,304 42,152 21,076 10,538 5,269 15,808 7,904 3,952 1,976 988 494 247 742 371 1,114 557 1,672 836 418 209 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304 152 76

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,526,257 Browse Full Index Next Integer #2,526,259 →