2,476,566

2 × 3² × 137587

2,476,566 factors as 2 × 3^2 × 137587. Its 12 positive divisors give a proper-divisor sum of 2,889,366, so this integer is abundant. The Collatz stopping time is 174 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 137587

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,365,932

Proper Divisor Sum 2,889,366

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #2476561 ← → #2476567

Radix Representation

Decimal	2476566
Binary	1001011100101000010110 (22 bits)
Octal	0o11345026
Hexadecimal	0x25CA16

Divisor Catalog (12)

1 2 3 6 9 18 137,587 275,174 412,761 825,522 1,238,283 2,476,566

Collatz Trajectory (174 steps to reach 1)

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

2,476,566 1,238,283 3,714,850 1,857,425 5,572,276 2,786,138 1,393,069 4,179,208 2,089,604 1,044,802 522,401 1,567,204 783,602 391,801 1,175,404 587,702 293,851 881,554 440,777 1,322,332 661,166 330,583 991,750 495,875 1,487,626 743,813 2,231,440 1,115,720 557,860 278,930 139,465 418,396 209,198 104,599 313,798 156,899 470,698 235,349 706,048 353,024 176,512 88,256 44,128 22,064 11,032 5,516 2,758 1,379 4,138 2,069 6,208 3,104 1,552 776 388 194 97 292 146 73

← Previous Integer #2,476,565 Browse Full Index Next Integer #2,476,567 →