8,913,636

2² × 3² × 247601

8,913,636 factors as 2^2 × 3^2 × 247601. Its 18 positive divisors give a proper-divisor sum of 13,618,146, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 247601

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 22,531,782

Proper Divisor Sum 13,618,146

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #8913623 ← → #8913677

Radix Representation

Decimal	8913636
Binary	100010000000001011100100 (24 bits)
Octal	0o42001344
Hexadecimal	0x8802E4

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 247,601 495,202 742,803 990,404 1,485,606 2,228,409 2,971,212 4,456,818 8,913,636

Collatz Trajectory (88 steps to reach 1)

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

8,913,636 4,456,818 2,228,409 6,685,228 3,342,614 1,671,307 5,013,922 2,506,961 7,520,884 3,760,442 1,880,221 5,640,664 2,820,332 1,410,166 705,083 2,115,250 1,057,625 3,172,876 1,586,438 793,219 2,379,658 1,189,829 3,569,488 1,784,744 892,372 446,186 223,093 669,280 334,640 167,320 83,660 41,830 20,915 62,746 31,373 94,120 47,060 23,530 11,765 35,296 17,648 8,824 4,412 2,206 1,103 3,310 1,655 4,966 2,483 7,450 3,725 11,176 5,588 2,794 1,397 4,192 2,096 1,048 524 262

← Previous Integer #8,913,635 Browse Full Index Next Integer #8,913,637 →