859,248

2⁴ × 3⁵ × 13 × 17

859,248 factors as 2^4 × 3^5 × 13 × 17. Its 120 positive divisors give a proper-divisor sum of 1,984,320, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^4 × 3^5 × 13 × 17

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 120

Divisor Sum (σ) 2,843,568

Proper Divisor Sum 1,984,320

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #859223 ← → #859249

Radix Representation

Decimal	859248
Binary	11010001110001110000 (20 bits)
Octal	0o3216160
Hexadecimal	0xD1C70

Divisor Catalog (60 of 120)

1 2 3 4 6 8 9 12 13 16 17 18 24 26 27 34 36 39 48 51 52 54 68 72 78 81 102 104 108 117 136 144 153 156 162 204 208 216 221 234 243 272 306 312 324 351 408 432 442 459 468 486 612 624 648 663 702 816 884 918

Collatz Trajectory (100 steps to reach 1)

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

859,248 429,624 214,812 107,406 53,703 161,110 80,555 241,666 120,833 362,500 181,250 90,625 271,876 135,938 67,969 203,908 101,954 50,977 152,932 76,466 38,233 114,700 57,350 28,675 86,026 43,013 129,040 64,520 32,260 16,130 8,065 24,196 12,098 6,049 18,148 9,074 4,537 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

← Previous Integer #859,247 Browse Full Index Next Integer #859,249 →