2,340,516

2² × 3 × 195043

2,340,516 factors as 2^2 × 3 × 195043. Its 12 positive divisors give a proper-divisor sum of 3,120,716, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 195043

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,461,232

Proper Divisor Sum 3,120,716

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2340493 ← → #2340521

Radix Representation

Decimal	2340516
Binary	1000111011011010100100 (22 bits)
Octal	0o10733244
Hexadecimal	0x23B6A4

Divisor Catalog (12)

1 2 3 4 6 12 195,043 390,086 585,129 780,172 1,170,258 2,340,516

Collatz Trajectory (130 steps to reach 1)

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

2,340,516 1,170,258 585,129 1,755,388 877,694 438,847 1,316,542 658,271 1,974,814 987,407 2,962,222 1,481,111 4,443,334 2,221,667 6,665,002 3,332,501 9,997,504 4,998,752 2,499,376 1,249,688 624,844 312,422 156,211 468,634 234,317 702,952 351,476 175,738 87,869 263,608 131,804 65,902 32,951 98,854 49,427 148,282 74,141 222,424 111,212 55,606 27,803 83,410 41,705 125,116 62,558 31,279 93,838 46,919 140,758 70,379 211,138 105,569 316,708 158,354 79,177 237,532 118,766 59,383 178,150 89,075

← Previous Integer #2,340,515 Browse Full Index Next Integer #2,340,517 →