5,490,294

2 × 3 × 915049

5,490,294 factors as 2 × 3 × 915049. Its 8 positive divisors give a proper-divisor sum of 5,490,306, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2 × 3 × 915049

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,980,600

Proper Divisor Sum 5,490,306

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5490293 ← → #5490299

Radix Representation

Decimal	5490294
Binary	10100111100011001110110 (23 bits)
Octal	0o24743166
Hexadecimal	0x53C676

Divisor Catalog (8)

1 2 3 6 915,049 1,830,098 2,745,147 5,490,294

Collatz Trajectory (157 steps to reach 1)

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

5,490,294 2,745,147 8,235,442 4,117,721 12,353,164 6,176,582 3,088,291 9,264,874 4,632,437 13,897,312 6,948,656 3,474,328 1,737,164 868,582 434,291 1,302,874 651,437 1,954,312 977,156 488,578 244,289 732,868 366,434 183,217 549,652 274,826 137,413 412,240 206,120 103,060 51,530 25,765 77,296 38,648 19,324 9,662 4,831 14,494 7,247 21,742 10,871 32,614 16,307 48,922 24,461 73,384 36,692 18,346 9,173 27,520 13,760 6,880 3,440 1,720 860 430 215 646 323 970

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,490,293 Browse Full Index Next Integer #5,490,295 →