9,265,660

2² × 5 × 463283

9,265,660 factors as 2^2 × 5 × 463283. Its 12 positive divisors give a proper-divisor sum of 10,192,268, so this integer is abundant. The Collatz stopping time is 225 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 463283

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,457,928

Proper Divisor Sum 10,192,268

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #9265657 ← → #9265679

Radix Representation

Decimal	9265660
Binary	100011010110000111111100 (24 bits)
Octal	0o43260774
Hexadecimal	0x8D61FC

Divisor Catalog (12)

1 2 4 5 10 20 463,283 926,566 1,853,132 2,316,415 4,632,830 9,265,660

Collatz Trajectory (225 steps to reach 1)

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

9,265,660 4,632,830 2,316,415 6,949,246 3,474,623 10,423,870 5,211,935 15,635,806 7,817,903 23,453,710 11,726,855 35,180,566 17,590,283 52,770,850 26,385,425 79,156,276 39,578,138 19,789,069 59,367,208 29,683,604 14,841,802 7,420,901 22,262,704 11,131,352 5,565,676 2,782,838 1,391,419 4,174,258 2,087,129 6,261,388 3,130,694 1,565,347 4,696,042 2,348,021 7,044,064 3,522,032 1,761,016 880,508 440,254 220,127 660,382 330,191 990,574 495,287 1,485,862 742,931 2,228,794 1,114,397 3,343,192 1,671,596 835,798 417,899 1,253,698 626,849 1,880,548 940,274 470,137 1,410,412 705,206 352,603

← Previous Integer #9,265,659 Browse Full Index Next Integer #9,265,661 →