3,115,588

2² × 7 × 111271

3,115,588 factors as 2^2 × 7 × 111271. Its 12 positive divisors give a proper-divisor sum of 3,115,644, so this integer is abundant. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 111271

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,231,232

Proper Divisor Sum 3,115,644

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3115579 ← → #3115591

Radix Representation

Decimal	3115588
Binary	1011111000101001000100 (22 bits)
Octal	0o13705104
Hexadecimal	0x2F8A44

Divisor Catalog (12)

1 2 4 7 14 28 111,271 222,542 445,084 778,897 1,557,794 3,115,588

Collatz Trajectory (151 steps to reach 1)

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

3,115,588 1,557,794 778,897 2,336,692 1,168,346 584,173 1,752,520 876,260 438,130 219,065 657,196 328,598 164,299 492,898 246,449 739,348 369,674 184,837 554,512 277,256 138,628 69,314 34,657 103,972 51,986 25,993 77,980 38,990 19,495 58,486 29,243 87,730 43,865 131,596 65,798 32,899 98,698 49,349 148,048 74,024 37,012 18,506 9,253 27,760 13,880 6,940 3,470 1,735 5,206 2,603 7,810 3,905 11,716 5,858 2,929 8,788 4,394 2,197 6,592 3,296

← Previous Integer #3,115,587 Browse Full Index Next Integer #3,115,589 →