2,495,620

2² × 5 × 124781

2,495,620 factors as 2^2 × 5 × 124781. Its 12 positive divisors give a proper-divisor sum of 2,745,224, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 124781

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,240,844

Proper Divisor Sum 2,745,224

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2495599 ← → #2495621

Radix Representation

Decimal	2495620
Binary	1001100001010010000100 (22 bits)
Octal	0o11412204
Hexadecimal	0x261484

Divisor Catalog (12)

1 2 4 5 10 20 124,781 249,562 499,124 623,905 1,247,810 2,495,620

Collatz Trajectory (130 steps to reach 1)

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

2,495,620 1,247,810 623,905 1,871,716 935,858 467,929 1,403,788 701,894 350,947 1,052,842 526,421 1,579,264 789,632 394,816 197,408 98,704 49,352 24,676 12,338 6,169 18,508 9,254 4,627 13,882 6,941 20,824 10,412 5,206 2,603 7,810 3,905 11,716 5,858 2,929 8,788 4,394 2,197 6,592 3,296 1,648 824 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,495,619 Browse Full Index Next Integer #2,495,621 →