2,715,786

2 × 3² × 31² × 157

2,715,786 factors as 2 × 3^2 × 31^2 × 157. Its 36 positive divisors give a proper-divisor sum of 3,403,080, so this integer is abundant. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 31^2 × 157

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 6,118,866

Proper Divisor Sum 3,403,080

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #2715749 ← → #2715787

Radix Representation

Decimal	2715786
Binary	1010010111000010001010 (22 bits)
Octal	0o12270212
Hexadecimal	0x29708A

Divisor Catalog (36)

1 2 3 6 9 18 31 62 93 157 186 279 314 471 558 942 961 1,413 1,922 2,826 2,883 4,867 5,766 8,649 9,734 14,601 17,298 29,202 43,803 87,606 150,877 301,754 452,631 905,262 1,357,893 2,715,786

Collatz Trajectory (156 steps to reach 1)

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

2,715,786 1,357,893 4,073,680 2,036,840 1,018,420 509,210 254,605 763,816 381,908 190,954 95,477 286,432 143,216 71,608 35,804 17,902 8,951 26,854 13,427 40,282 20,141 60,424 30,212 15,106 7,553 22,660 11,330 5,665 16,996 8,498 4,249 12,748 6,374 3,187 9,562 4,781 14,344 7,172 3,586 1,793 5,380 2,690 1,345 4,036 2,018 1,009 3,028 1,514 757 2,272 1,136 568 284 142 71 214 107 322 161 484

← Previous Integer #2,715,785 Browse Full Index Next Integer #2,715,787 →