2,500,170

2 × 3 × 5 × 83339

2,500,170 factors as 2 × 3 × 5 × 83339. Its 16 positive divisors give a proper-divisor sum of 3,500,310, so this integer is abundant. The Collatz stopping time is 112 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 83339

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,000,480

Proper Divisor Sum 3,500,310

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #2500163 ← → #2500171

Radix Representation

Decimal	2500170
Binary	1001100010011001001010 (22 bits)
Octal	0o11423112
Hexadecimal	0x26264A

Divisor Catalog (16)

1 2 3 5 6 10 15 30 83,339 166,678 250,017 416,695 500,034 833,390 1,250,085 2,500,170

Collatz Trajectory (112 steps to reach 1)

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

2,500,170 1,250,085 3,750,256 1,875,128 937,564 468,782 234,391 703,174 351,587 1,054,762 527,381 1,582,144 791,072 395,536 197,768 98,884 49,442 24,721 74,164 37,082 18,541 55,624 27,812 13,906 6,953 20,860 10,430 5,215 15,646 7,823 23,470 11,735 35,206 17,603 52,810 26,405 79,216 39,608 19,804 9,902 4,951 14,854 7,427 22,282 11,141 33,424 16,712 8,356 4,178 2,089 6,268 3,134 1,567 4,702 2,351 7,054 3,527 10,582 5,291 15,874

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,500,169 Browse Full Index Next Integer #2,500,171 →