9,390,612

2² × 3 × 7 × 11 × 10163

9,390,612 factors as 2^2 × 3 × 7 × 11 × 10163. Its 48 positive divisors give a proper-divisor sum of 17,930,220, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 11 × 10163

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 27,320,832

Proper Divisor Sum 17,930,220

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9390607 ← → #9390629

Radix Representation

Decimal	9390612
Binary	100011110100101000010100 (24 bits)
Octal	0o43645024
Hexadecimal	0x8F4A14

Divisor Catalog (48)

1 2 3 4 6 7 11 12 14 21 22 28 33 42 44 66 77 84 132 154 231 308 462 924 10,163 20,326 30,489 40,652 60,978 71,141 111,793 121,956 142,282 213,423 223,586 284,564 335,379 426,846 447,172 670,758 782,551 853,692 1,341,516 1,565,102 2,347,653 3,130,204 4,695,306 9,390,612

Collatz Trajectory (101 steps to reach 1)

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

9,390,612 4,695,306 2,347,653 7,042,960 3,521,480 1,760,740 880,370 440,185 1,320,556 660,278 330,139 990,418 495,209 1,485,628 742,814 371,407 1,114,222 557,111 1,671,334 835,667 2,507,002 1,253,501 3,760,504 1,880,252 940,126 470,063 1,410,190 705,095 2,115,286 1,057,643 3,172,930 1,586,465 4,759,396 2,379,698 1,189,849 3,569,548 1,784,774 892,387 2,677,162 1,338,581 4,015,744 2,007,872 1,003,936 501,968 250,984 125,492 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

← Previous Integer #9,390,611 Browse Full Index Next Integer #9,390,613 →