9,522,198

2 × 3⁷ × 7 × 311

9,522,198 factors as 2 × 3^7 × 7 × 311. Its 64 positive divisors give a proper-divisor sum of 15,038,442, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2 × 3^7 × 7 × 311

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 24,560,640

Proper Divisor Sum 15,038,442

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9522197 ← → #9522203

Radix Representation

Decimal	9522198
Binary	100100010100110000010110 (24 bits)
Octal	0o44246026
Hexadecimal	0x914C16

Divisor Catalog (60 of 64)

1 2 3 6 7 9 14 18 21 27 42 54 63 81 126 162 189 243 311 378 486 567 622 729 933 1,134 1,458 1,701 1,866 2,177 2,187 2,799 3,402 4,354 4,374 5,103 5,598 6,531 8,397 10,206 13,062 15,309 16,794 19,593 25,191 30,618 39,186 50,382 58,779 75,573 117,558 151,146 176,337 226,719 352,674 453,438 529,011 680,157 1,058,022 1,360,314

Collatz Trajectory (145 steps to reach 1)

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

9,522,198 4,761,099 14,283,298 7,141,649 21,424,948 10,712,474 5,356,237 16,068,712 8,034,356 4,017,178 2,008,589 6,025,768 3,012,884 1,506,442 753,221 2,259,664 1,129,832 564,916 282,458 141,229 423,688 211,844 105,922 52,961 158,884 79,442 39,721 119,164 59,582 29,791 89,374 44,687 134,062 67,031 201,094 100,547 301,642 150,821 452,464 226,232 113,116 56,558 28,279 84,838 42,419 127,258 63,629 190,888 95,444 47,722 23,861 71,584 35,792 17,896 8,948 4,474 2,237 6,712 3,356 1,678

← Previous Integer #9,522,197 Browse Full Index Next Integer #9,522,199 →