9,102,906

2 × 3² × 461 × 1097

9,102,906 factors as 2 × 3^2 × 461 × 1097. Its 24 positive divisors give a proper-divisor sum of 10,680,858, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 461 × 1097

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,783,764

Proper Divisor Sum 10,680,858

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9102901 ← → #9102911

Radix Representation

Decimal	9102906
Binary	100010101110011000111010 (24 bits)
Octal	0o42563072
Hexadecimal	0x8AE63A

Divisor Catalog (24)

Collatz Trajectory (80 steps to reach 1)

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

9,102,906 4,551,453 13,654,360 6,827,180 3,413,590 1,706,795 5,120,386 2,560,193 7,680,580 3,840,290 1,920,145 5,760,436 2,880,218 1,440,109 4,320,328 2,160,164 1,080,082 540,041 1,620,124 810,062 405,031 1,215,094 607,547 1,822,642 911,321 2,733,964 1,366,982 683,491 2,050,474 1,025,237 3,075,712 1,537,856 768,928 384,464 192,232 96,116 48,058 24,029 72,088 36,044 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070 535 1,606

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,102,905 Browse Full Index Next Integer #9,102,907 →