8,752,068

2² × 3² × 13 × 18701

8,752,068 factors as 2^2 × 3^2 × 13 × 18701. Its 36 positive divisors give a proper-divisor sum of 15,074,280, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 13 × 18701

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 23,826,348

Proper Divisor Sum 15,074,280

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #8752067 ← → #8752123

Radix Representation

Decimal	8752068
Binary	100001011000101111000100 (24 bits)
Octal	0o41305704
Hexadecimal	0x858BC4

Divisor Catalog (36)

1 2 3 4 6 9 12 13 18 26 36 39 52 78 117 156 234 468 18,701 37,402 56,103 74,804 112,206 168,309 224,412 243,113 336,618 486,226 673,236 729,339 972,452 1,458,678 2,188,017 2,917,356 4,376,034 8,752,068

Collatz Trajectory (137 steps to reach 1)

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

8,752,068 4,376,034 2,188,017 6,564,052 3,282,026 1,641,013 4,923,040 2,461,520 1,230,760 615,380 307,690 153,845 461,536 230,768 115,384 57,692 28,846 14,423 43,270 21,635 64,906 32,453 97,360 48,680 24,340 12,170 6,085 18,256 9,128 4,564 2,282 1,141 3,424 1,712 856 428 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263

← Previous Integer #8,752,067 Browse Full Index Next Integer #8,752,069 →