8,804,070

2 × 3² × 5 × 11 × 8893

8,804,070 factors as 2 × 3^2 × 5 × 11 × 8893. Its 48 positive divisors give a proper-divisor sum of 16,170,282, so this integer is abundant. The Collatz stopping time is 199 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 11 × 8893

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,974,352

Proper Divisor Sum 16,170,282

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #8804051 ← → #8804077

Radix Representation

Decimal	8804070
Binary	100001100101011011100110 (24 bits)
Octal	0o41453346
Hexadecimal	0x8656E6

Divisor Catalog (48)

1 2 3 5 6 9 10 11 15 18 22 30 33 45 55 66 90 99 110 165 198 330 495 990 8,893 17,786 26,679 44,465 53,358 80,037 88,930 97,823 133,395 160,074 195,646 266,790 293,469 400,185 489,115 586,938 800,370 880,407 978,230 1,467,345 1,760,814 2,934,690 4,402,035 8,804,070

Collatz Trajectory (199 steps to reach 1)

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

8,804,070 4,402,035 13,206,106 6,603,053 19,809,160 9,904,580 4,952,290 2,476,145 7,428,436 3,714,218 1,857,109 5,571,328 2,785,664 1,392,832 696,416 348,208 174,104 87,052 43,526 21,763 65,290 32,645 97,936 48,968 24,484 12,242 6,121 18,364 9,182 4,591 13,774 6,887 20,662 10,331 30,994 15,497 46,492 23,246 11,623 34,870 17,435 52,306 26,153 78,460 39,230 19,615 58,846 29,423 88,270 44,135 132,406 66,203 198,610 99,305 297,916 148,958 74,479 223,438 111,719 335,158

← Previous Integer #8,804,069 Browse Full Index Next Integer #8,804,071 →