5,289,546

2 × 3 × 881591

5,289,546 factors as 2 × 3 × 881591. Its 8 positive divisors give a proper-divisor sum of 5,289,558, so this integer is abundant. The Collatz stopping time is 126 steps.

Prime Factor Structure

Factorization String 2 × 3 × 881591

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,579,104

Proper Divisor Sum 5,289,558

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #5289539 ← → #5289547

Radix Representation

Decimal	5289546
Binary	10100001011011001001010 (23 bits)
Octal	0o24133112
Hexadecimal	0x50B64A

Divisor Catalog (8)

1 2 3 6 881,591 1,763,182 2,644,773 5,289,546

Collatz Trajectory (126 steps to reach 1)

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

5,289,546 2,644,773 7,934,320 3,967,160 1,983,580 991,790 495,895 1,487,686 743,843 2,231,530 1,115,765 3,347,296 1,673,648 836,824 418,412 209,206 104,603 313,810 156,905 470,716 235,358 117,679 353,038 176,519 529,558 264,779 794,338 397,169 1,191,508 595,754 297,877 893,632 446,816 223,408 111,704 55,852 27,926 13,963 41,890 20,945 62,836 31,418 15,709 47,128 23,564 11,782 5,891 17,674 8,837 26,512 13,256 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,289,545 Browse Full Index Next Integer #5,289,547 →