8,938,848

2⁵ × 3 × 93113

8,938,848 factors as 2^5 × 3 × 93113. Its 24 positive divisors give a proper-divisor sum of 14,525,880, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 93113

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 23,464,728

Proper Divisor Sum 14,525,880

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #8938843 ← → #8938849

Radix Representation

Decimal	8938848
Binary	100010000110010101100000 (24 bits)
Octal	0o42062540
Hexadecimal	0x886560

Divisor Catalog (24)

Collatz Trajectory (150 steps to reach 1)

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

8,938,848 4,469,424 2,234,712 1,117,356 558,678 279,339 838,018 419,009 1,257,028 628,514 314,257 942,772 471,386 235,693 707,080 353,540 176,770 88,385 265,156 132,578 66,289 198,868 99,434 49,717 149,152 74,576 37,288 18,644 9,322 4,661 13,984 6,992 3,496 1,748 874 437 1,312 656 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,938,847 Browse Full Index Next Integer #8,938,849 →