6,831,624

2³ × 3 × 284651

6,831,624 factors as 2^3 × 3 × 284651. Its 16 positive divisors give a proper-divisor sum of 10,247,496, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 284651

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 17,079,120

Proper Divisor Sum 10,247,496

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6831611 ← → #6831631

Radix Representation

Decimal	6831624
Binary	11010000011111000001000 (23 bits)
Octal	0o32037010
Hexadecimal	0x683E08

Divisor Catalog (16)

1 2 3 4 6 8 12 24 284,651 569,302 853,953 1,138,604 1,707,906 2,277,208 3,415,812 6,831,624

Collatz Trajectory (129 steps to reach 1)

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

6,831,624 3,415,812 1,707,906 853,953 2,561,860 1,280,930 640,465 1,921,396 960,698 480,349 1,441,048 720,524 360,262 180,131 540,394 270,197 810,592 405,296 202,648 101,324 50,662 25,331 75,994 37,997 113,992 56,996 28,498 14,249 42,748 21,374 10,687 32,062 16,031 48,094 24,047 72,142 36,071 108,214 54,107 162,322 81,161 243,484 121,742 60,871 182,614 91,307 273,922 136,961 410,884 205,442 102,721 308,164 154,082 77,041 231,124 115,562 57,781 173,344 86,672 43,336

← Previous Integer #6,831,623 Browse Full Index Next Integer #6,831,625 →