2,302,660

2² × 5 × 115133

2,302,660 factors as 2^2 × 5 × 115133. Its 12 positive divisors give a proper-divisor sum of 2,532,968, so this integer is abundant. The Collatz stopping time is 104 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 115133

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,835,628

Proper Divisor Sum 2,532,968

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #2302631 ← → #2302661

Radix Representation

Decimal	2302660
Binary	1000110010001011000100 (22 bits)
Octal	0o10621304
Hexadecimal	0x2322C4

Divisor Catalog (12)

1 2 4 5 10 20 115,133 230,266 460,532 575,665 1,151,330 2,302,660

Collatz Trajectory (104 steps to reach 1)

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

2,302,660 1,151,330 575,665 1,726,996 863,498 431,749 1,295,248 647,624 323,812 161,906 80,953 242,860 121,430 60,715 182,146 91,073 273,220 136,610 68,305 204,916 102,458 51,229 153,688 76,844 38,422 19,211 57,634 28,817 86,452 43,226 21,613 64,840 32,420 16,210 8,105 24,316 12,158 6,079 18,238 9,119 27,358 13,679 41,038 20,519 61,558 30,779 92,338 46,169 138,508 69,254 34,627 103,882 51,941 155,824 77,912 38,956 19,478 9,739 29,218 14,609

← Previous Integer #2,302,659 Browse Full Index Next Integer #2,302,661 →