5,488,868

2² × 7 × 11 × 71 × 251

5,488,868 factors as 2^2 × 7 × 11 × 71 × 251. Its 48 positive divisors give a proper-divisor sum of 6,703,900, so this integer is abundant. The Collatz stopping time is 201 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 11 × 71 × 251

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 12,192,768

Proper Divisor Sum 6,703,900

Digit Sum / Digital Root 47 (Root: 2)

Adjacent Primes #5488867 ← → #5488871

Radix Representation

Decimal	5488868
Binary	10100111100000011100100 (23 bits)
Octal	0o24740344
Hexadecimal	0x53C0E4

Divisor Catalog (48)

1 2 4 7 11 14 22 28 44 71 77 142 154 251 284 308 497 502 781 994 1,004 1,562 1,757 1,988 2,761 3,124 3,514 5,467 5,522 7,028 10,934 11,044 17,821 19,327 21,868 35,642 38,654 71,284 77,308 124,747 196,031 249,494 392,062 498,988 784,124 1,372,217 2,744,434 5,488,868

Collatz Trajectory (201 steps to reach 1)

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

5,488,868 2,744,434 1,372,217 4,116,652 2,058,326 1,029,163 3,087,490 1,543,745 4,631,236 2,315,618 1,157,809 3,473,428 1,736,714 868,357 2,605,072 1,302,536 651,268 325,634 162,817 488,452 244,226 122,113 366,340 183,170 91,585 274,756 137,378 68,689 206,068 103,034 51,517 154,552 77,276 38,638 19,319 57,958 28,979 86,938 43,469 130,408 65,204 32,602 16,301 48,904 24,452 12,226 6,113 18,340 9,170 4,585 13,756 6,878 3,439 10,318 5,159 15,478 7,739 23,218 11,609 34,828

← Previous Integer #5,488,867 Browse Full Index Next Integer #5,488,869 →