2,579,349

3 × 859783

2,579,349 factors as 3 × 859783. Its 4 positive divisors give a proper-divisor sum of 859,787, so this integer is deficient. The Collatz stopping time is 143 steps.

Prime Factor Structure

Factorization String 3 × 859783

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 3,439,136

Proper Divisor Sum 859,787

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2579341 ← → #2579363

Radix Representation

Decimal	2579349
Binary	1001110101101110010101 (22 bits)
Octal	0o11655625
Hexadecimal	0x275B95

Divisor Catalog (4)

1 3 859,783 2,579,349

Collatz Trajectory (143 steps to reach 1)

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

2,579,349 7,738,048 3,869,024 1,934,512 967,256 483,628 241,814 120,907 362,722 181,361 544,084 272,042 136,021 408,064 204,032 102,016 51,008 25,504 12,752 6,376 3,188 1,594 797 2,392 1,196 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466

← Previous Integer #2,579,348 Browse Full Index Next Integer #2,579,350 →