5,829,546

2 × 3 × 971591

5,829,546 factors as 2 × 3 × 971591. Its 8 positive divisors give a proper-divisor sum of 5,829,558, so this integer is abundant. The Collatz stopping time is 183 steps.

Prime Factor Structure

Factorization String 2 × 3 × 971591

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,659,104

Proper Divisor Sum 5,829,558

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #5829539 ← → #5829559

Radix Representation

Decimal	5829546
Binary	10110001111001110101010 (23 bits)
Octal	0o26171652
Hexadecimal	0x58F3AA

Divisor Catalog (8)

1 2 3 6 971,591 1,943,182 2,914,773 5,829,546

Collatz Trajectory (183 steps to reach 1)

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

5,829,546 2,914,773 8,744,320 4,372,160 2,186,080 1,093,040 546,520 273,260 136,630 68,315 204,946 102,473 307,420 153,710 76,855 230,566 115,283 345,850 172,925 518,776 259,388 129,694 64,847 194,542 97,271 291,814 145,907 437,722 218,861 656,584 328,292 164,146 82,073 246,220 123,110 61,555 184,666 92,333 277,000 138,500 69,250 34,625 103,876 51,938 25,969 77,908 38,954 19,477 58,432 29,216 14,608 7,304 3,652 1,826 913 2,740 1,370 685 2,056 1,028

← Previous Integer #5,829,545 Browse Full Index Next Integer #5,829,547 →