8,603,924

2² × 7 × 307283

8,603,924 factors as 2^2 × 7 × 307283. Its 12 positive divisors give a proper-divisor sum of 8,603,980, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 307283

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 17,207,904

Proper Divisor Sum 8,603,980

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #8603893 ← → #8603927

Radix Representation

Decimal	8603924
Binary	100000110100100100010100 (24 bits)
Octal	0o40644424
Hexadecimal	0x834914

Divisor Catalog (12)

1 2 4 7 14 28 307,283 614,566 1,229,132 2,150,981 4,301,962 8,603,924

Collatz Trajectory (168 steps to reach 1)

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

8,603,924 4,301,962 2,150,981 6,452,944 3,226,472 1,613,236 806,618 403,309 1,209,928 604,964 302,482 151,241 453,724 226,862 113,431 340,294 170,147 510,442 255,221 765,664 382,832 191,416 95,708 47,854 23,927 71,782 35,891 107,674 53,837 161,512 80,756 40,378 20,189 60,568 30,284 15,142 7,571 22,714 11,357 34,072 17,036 8,518 4,259 12,778 6,389 19,168 9,584 4,792 2,396 1,198 599 1,798 899 2,698 1,349 4,048 2,024 1,012 506 253

← Previous Integer #8,603,923 Browse Full Index Next Integer #8,603,925 →