9,225,354

2 × 3 × 1537559

9,225,354 factors as 2 × 3 × 1537559. Its 8 positive divisors give a proper-divisor sum of 9,225,366, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1537559

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 18,450,720

Proper Divisor Sum 9,225,366

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9225353 ← → #9225361

Radix Representation

Decimal	9225354
Binary	100011001100010010001010 (24 bits)
Octal	0o43142212
Hexadecimal	0x8CC48A

Divisor Catalog (8)

1 2 3 6 1,537,559 3,075,118 4,612,677 9,225,354

Collatz Trajectory (212 steps to reach 1)

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

9,225,354 4,612,677 13,838,032 6,919,016 3,459,508 1,729,754 864,877 2,594,632 1,297,316 648,658 324,329 972,988 486,494 243,247 729,742 364,871 1,094,614 547,307 1,641,922 820,961 2,462,884 1,231,442 615,721 1,847,164 923,582 461,791 1,385,374 692,687 2,078,062 1,039,031 3,117,094 1,558,547 4,675,642 2,337,821 7,013,464 3,506,732 1,753,366 876,683 2,630,050 1,315,025 3,945,076 1,972,538 986,269 2,958,808 1,479,404 739,702 369,851 1,109,554 554,777 1,664,332 832,166 416,083 1,248,250 624,125 1,872,376 936,188 468,094 234,047 702,142 351,071

← Previous Integer #9,225,353 Browse Full Index Next Integer #9,225,355 →