580,458

2 × 3 × 89 × 1087

580,458 factors as 2 × 3 × 89 × 1087. Its 16 positive divisors give a proper-divisor sum of 594,582, so this integer is abundant. The Collatz stopping time is 190 steps.

Prime Factor Structure

Factorization String 2 × 3 × 89 × 1087

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,175,040

Proper Divisor Sum 594,582

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #580417 ← → #580471

Radix Representation

Decimal	580458
Binary	10001101101101101010 (20 bits)
Octal	0o2155552
Hexadecimal	0x8DB6A

Divisor Catalog (16)

1 2 3 6 89 178 267 534 1,087 2,174 3,261 6,522 96,743 193,486 290,229 580,458

Collatz Trajectory (190 steps to reach 1)

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

580,458 290,229 870,688 435,344 217,672 108,836 54,418 27,209 81,628 40,814 20,407 61,222 30,611 91,834 45,917 137,752 68,876 34,438 17,219 51,658 25,829 77,488 38,744 19,372 9,686 4,843 14,530 7,265 21,796 10,898 5,449 16,348 8,174 4,087 12,262 6,131 18,394 9,197 27,592 13,796 6,898 3,449 10,348 5,174 2,587 7,762 3,881 11,644 5,822 2,911 8,734 4,367 13,102 6,551 19,654 9,827 29,482 14,741 44,224 22,112

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #580,457 Browse Full Index Next Integer #580,459 →