5,801,000

2³ × 5³ × 5801

5,801,000 factors as 2^3 × 5^3 × 5801. Its 32 positive divisors give a proper-divisor sum of 7,775,680, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^3 × 5^3 × 5801

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 13,576,680

Proper Divisor Sum 7,775,680

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #5800997 ← → #5801011

Radix Representation

Decimal	5801000
Binary	10110001000010000101000 (23 bits)
Octal	0o26102050
Hexadecimal	0x588428

Divisor Catalog (32)

1 2 4 5 8 10 20 25 40 50 100 125 200 250 500 1,000 5,801 11,602 23,204 29,005 46,408 58,010 116,020 145,025 232,040 290,050 580,100 725,125 1,160,200 1,450,250 2,900,500 5,801,000

Collatz Trajectory (95 steps to reach 1)

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

5,801,000 2,900,500 1,450,250 725,125 2,175,376 1,087,688 543,844 271,922 135,961 407,884 203,942 101,971 305,914 152,957 458,872 229,436 114,718 57,359 172,078 86,039 258,118 129,059 387,178 193,589 580,768 290,384 145,192 72,596 36,298 18,149 54,448 27,224 13,612 6,806 3,403 10,210 5,105 15,316 7,658 3,829 11,488 5,744 2,872 1,436 718 359 1,078 539 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102 2,051 6,154

← Previous Integer #5,800,999 Browse Full Index Next Integer #5,801,001 →