5,277,138

2 × 3 × 879523

5,277,138 factors as 2 × 3 × 879523. Its 8 positive divisors give a proper-divisor sum of 5,277,150, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2 × 3 × 879523

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,554,288

Proper Divisor Sum 5,277,150

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5277131 ← → #5277163

Radix Representation

Decimal	5277138
Binary	10100001000010111010010 (23 bits)
Octal	0o24102722
Hexadecimal	0x5085D2

Divisor Catalog (8)

1 2 3 6 879,523 1,759,046 2,638,569 5,277,138

Collatz Trajectory (188 steps to reach 1)

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

5,277,138 2,638,569 7,915,708 3,957,854 1,978,927 5,936,782 2,968,391 8,905,174 4,452,587 13,357,762 6,678,881 20,036,644 10,018,322 5,009,161 15,027,484 7,513,742 3,756,871 11,270,614 5,635,307 16,905,922 8,452,961 25,358,884 12,679,442 6,339,721 19,019,164 9,509,582 4,754,791 14,264,374 7,132,187 21,396,562 10,698,281 32,094,844 16,047,422 8,023,711 24,071,134 12,035,567 36,106,702 18,053,351 54,160,054 27,080,027 81,240,082 40,620,041 121,860,124 60,930,062 30,465,031 91,395,094 45,697,547 137,092,642 68,546,321 205,638,964 102,819,482 51,409,741 154,229,224 77,114,612 38,557,306 19,278,653 57,835,960 28,917,980 14,458,990 7,229,495

← Previous Integer #5,277,137 Browse Full Index Next Integer #5,277,139 →