3,115,698

2 × 3 × 519283

3,115,698 factors as 2 × 3 × 519283. Its 8 positive divisors give a proper-divisor sum of 3,115,710, so this integer is abundant. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2 × 3 × 519283

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,231,408

Proper Divisor Sum 3,115,710

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3115667 ← → #3115727

Radix Representation

Decimal	3115698
Binary	1011111000101010110010 (22 bits)
Octal	0o13705262
Hexadecimal	0x2F8AB2

Divisor Catalog (8)

1 2 3 6 519,283 1,038,566 1,557,849 3,115,698

Collatz Trajectory (151 steps to reach 1)

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

3,115,698 1,557,849 4,673,548 2,336,774 1,168,387 3,505,162 1,752,581 5,257,744 2,628,872 1,314,436 657,218 328,609 985,828 492,914 246,457 739,372 369,686 184,843 554,530 277,265 831,796 415,898 207,949 623,848 311,924 155,962 77,981 233,944 116,972 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,115,697 Browse Full Index Next Integer #3,115,699 →