2,522,010

2 × 3 × 5 × 84067

2,522,010 factors as 2 × 3 × 5 × 84067. Its 16 positive divisors give a proper-divisor sum of 3,530,886, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 84067

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,052,896

Proper Divisor Sum 3,530,886

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #2521979 ← → #2522011

Radix Representation

Decimal	2522010
Binary	1001100111101110011010 (22 bits)
Octal	0o11475632
Hexadecimal	0x267B9A

Divisor Catalog (16)

1 2 3 5 6 10 15 30 84,067 168,134 252,201 420,335 504,402 840,670 1,261,005 2,522,010

Collatz Trajectory (130 steps to reach 1)

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

2,522,010 1,261,005 3,783,016 1,891,508 945,754 472,877 1,418,632 709,316 354,658 177,329 531,988 265,994 132,997 398,992 199,496 99,748 49,874 24,937 74,812 37,406 18,703 56,110 28,055 84,166 42,083 126,250 63,125 189,376 94,688 47,344 23,672 11,836 5,918 2,959 8,878 4,439 13,318 6,659 19,978 9,989 29,968 14,984 7,492 3,746 1,873 5,620 2,810 1,405 4,216 2,108 1,054 527 1,582 791 2,374 1,187 3,562 1,781 5,344 2,672

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,522,009 Browse Full Index Next Integer #2,522,011 →