3,555,260

2² × 5 × 177763

3,555,260 factors as 2^2 × 5 × 177763. Its 12 positive divisors give a proper-divisor sum of 3,910,828, so this integer is abundant. The Collatz stopping time is 120 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 177763

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,466,088

Proper Divisor Sum 3,910,828

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #3555257 ← → #3555269

Radix Representation

Decimal	3555260
Binary	1101100011111110111100 (22 bits)
Octal	0o15437674
Hexadecimal	0x363FBC

Divisor Catalog (12)

1 2 4 5 10 20 177,763 355,526 711,052 888,815 1,777,630 3,555,260

Collatz Trajectory (120 steps to reach 1)

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

3,555,260 1,777,630 888,815 2,666,446 1,333,223 3,999,670 1,999,835 5,999,506 2,999,753 8,999,260 4,499,630 2,249,815 6,749,446 3,374,723 10,124,170 5,062,085 15,186,256 7,593,128 3,796,564 1,898,282 949,141 2,847,424 1,423,712 711,856 355,928 177,964 88,982 44,491 133,474 66,737 200,212 100,106 50,053 150,160 75,080 37,540 18,770 9,385 28,156 14,078 7,039 21,118 10,559 31,678 15,839 47,518 23,759 71,278 35,639 106,918 53,459 160,378 80,189 240,568 120,284 60,142 30,071 90,214 45,107 135,322

← Previous Integer #3,555,259 Browse Full Index Next Integer #3,555,261 →