5,489,060

2² × 5 × 274453

5,489,060 factors as 2^2 × 5 × 274453. Its 12 positive divisors give a proper-divisor sum of 6,038,008, so this integer is abundant. The Collatz stopping time is 56 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 274453

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 11,527,068

Proper Divisor Sum 6,038,008

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #5489041 ← → #5489129

Radix Representation

Decimal	5489060
Binary	10100111100000110100100 (23 bits)
Octal	0o24740644
Hexadecimal	0x53C1A4

Divisor Catalog (12)

1 2 4 5 10 20 274,453 548,906 1,097,812 1,372,265 2,744,530 5,489,060

Collatz Trajectory (56 steps to reach 1)

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

5,489,060 2,744,530 1,372,265 4,116,796 2,058,398 1,029,199 3,087,598 1,543,799 4,631,398 2,315,699 6,947,098 3,473,549 10,420,648 5,210,324 2,605,162 1,302,581 3,907,744 1,953,872 976,936 488,468 244,234 122,117 366,352 183,176 91,588 45,794 22,897 68,692 34,346 17,173 51,520 25,760 12,880 6,440 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64 32 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,489,059 Browse Full Index Next Integer #5,489,061 →