5,746,032

2⁴ × 3³ × 47 × 283

5,746,032 factors as 2^4 × 3^3 × 47 × 283. Its 80 positive divisors give a proper-divisor sum of 11,157,648, so this integer is abundant. The Collatz stopping time is 214 steps.

Prime Factor Structure

Factorization String 2^4 × 3^3 × 47 × 283

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 16,903,680

Proper Divisor Sum 11,157,648

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5746001 ← → #5746033

Radix Representation

Decimal	5746032
Binary	10101111010110101110000 (23 bits)
Octal	0o25726560
Hexadecimal	0x57AD70

Divisor Catalog (60 of 80)

1 2 3 4 6 8 9 12 16 18 24 27 36 47 48 54 72 94 108 141 144 188 216 282 283 376 423 432 564 566 752 846 849 1,128 1,132 1,269 1,692 1,698 2,256 2,264 2,538 2,547 3,384 3,396 4,528 5,076 5,094 6,768 6,792 7,641 10,152 10,188 13,301 13,584 15,282 20,304 20,376 26,602 30,564 39,903

Collatz Trajectory (214 steps to reach 1)

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

5,746,032 2,873,016 1,436,508 718,254 359,127 1,077,382 538,691 1,616,074 808,037 2,424,112 1,212,056 606,028 303,014 151,507 454,522 227,261 681,784 340,892 170,446 85,223 255,670 127,835 383,506 191,753 575,260 287,630 143,815 431,446 215,723 647,170 323,585 970,756 485,378 242,689 728,068 364,034 182,017 546,052 273,026 136,513 409,540 204,770 102,385 307,156 153,578 76,789 230,368 115,184 57,592 28,796 14,398 7,199 21,598 10,799 32,398 16,199 48,598 24,299 72,898 36,449

← Previous Integer #5,746,031 Browse Full Index Next Integer #5,746,033 →