2,580,051

3 × 709 × 1213

2,580,051 factors as 3 × 709 × 1213. Its 8 positive divisors give a proper-divisor sum of 867,709, so this integer is deficient. The Collatz stopping time is 112 steps.

Prime Factor Structure

Factorization String 3 × 709 × 1213

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,447,760

Proper Divisor Sum 867,709

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2580049 ← → #2580079

Radix Representation

Decimal	2580051
Binary	1001110101111001010011 (22 bits)
Octal	0o11657123
Hexadecimal	0x275E53

Divisor Catalog (8)

1 3 709 1,213 2,127 3,639 860,017 2,580,051

Collatz Trajectory (112 steps to reach 1)

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

2,580,051 7,740,154 3,870,077 11,610,232 5,805,116 2,902,558 1,451,279 4,353,838 2,176,919 6,530,758 3,265,379 9,796,138 4,898,069 14,694,208 7,347,104 3,673,552 1,836,776 918,388 459,194 229,597 688,792 344,396 172,198 86,099 258,298 129,149 387,448 193,724 96,862 48,431 145,294 72,647 217,942 108,971 326,914 163,457 490,372 245,186 122,593 367,780 183,890 91,945 275,836 137,918 68,959 206,878 103,439 310,318 155,159 465,478 232,739 698,218 349,109 1,047,328 523,664 261,832 130,916 65,458 32,729 98,188

← Previous Integer #2,580,050 Browse Full Index Next Integer #2,580,052 →