5,810,328

2³ × 3² × 17 × 47 × 101

5,810,328 factors as 2^3 × 3^2 × 17 × 47 × 101. Its 96 positive divisors give a proper-divisor sum of 11,374,632, so this integer is abundant. The Collatz stopping time is 276 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 17 × 47 × 101

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 17,184,960

Proper Divisor Sum 11,374,632

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5810327 ← → #5810341

Radix Representation

Decimal	5810328
Binary	10110001010100010011000 (23 bits)
Octal	0o26124230
Hexadecimal	0x58A898

Divisor Catalog (60 of 96)

1 2 3 4 6 8 9 12 17 18 24 34 36 47 51 68 72 94 101 102 136 141 153 188 202 204 282 303 306 376 404 408 423 564 606 612 799 808 846 909 1,128 1,212 1,224 1,598 1,692 1,717 1,818 2,397 2,424 3,196 3,384 3,434 3,636 4,747 4,794 5,151 6,392 6,868 7,191 7,272

Collatz Trajectory (276 steps to reach 1)

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

5,810,328 2,905,164 1,452,582 726,291 2,178,874 1,089,437 3,268,312 1,634,156 817,078 408,539 1,225,618 612,809 1,838,428 919,214 459,607 1,378,822 689,411 2,068,234 1,034,117 3,102,352 1,551,176 775,588 387,794 193,897 581,692 290,846 145,423 436,270 218,135 654,406 327,203 981,610 490,805 1,472,416 736,208 368,104 184,052 92,026 46,013 138,040 69,020 34,510 17,255 51,766 25,883 77,650 38,825 116,476 58,238 29,119 87,358 43,679 131,038 65,519 196,558 98,279 294,838 147,419 442,258 221,129

← Previous Integer #5,810,327 Browse Full Index Next Integer #5,810,329 →