863,304

2³ × 3 × 13 × 2767

863,304 factors as 2^3 × 3 × 13 × 2767. Its 32 positive divisors give a proper-divisor sum of 1,461,816, so this integer is abundant. The Collatz stopping time is 144 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 13 × 2767

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 2,325,120

Proper Divisor Sum 1,461,816

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #863299 ← → #863309

Radix Representation

Decimal	863304
Binary	11010010110001001000 (20 bits)
Octal	0o3226110
Hexadecimal	0xD2C48

Divisor Catalog (32)

1 2 3 4 6 8 12 13 24 26 39 52 78 104 156 312 2,767 5,534 8,301 11,068 16,602 22,136 33,204 35,971 66,408 71,942 107,913 143,884 215,826 287,768 431,652 863,304

Collatz Trajectory (144 steps to reach 1)

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

863,304 431,652 215,826 107,913 323,740 161,870 80,935 242,806 121,403 364,210 182,105 546,316 273,158 136,579 409,738 204,869 614,608 307,304 153,652 76,826 38,413 115,240 57,620 28,810 14,405 43,216 21,608 10,804 5,402 2,701 8,104 4,052 2,026 1,013 3,040 1,520 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155

← Previous Integer #863,303 Browse Full Index Next Integer #863,305 →