9,869,358

2 × 3 × 1644893

9,869,358 factors as 2 × 3 × 1644893. Its 8 positive divisors give a proper-divisor sum of 9,869,370, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1644893

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 19,738,728

Proper Divisor Sum 9,869,370

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9869347 ← → #9869393

Radix Representation

Decimal	9869358
Binary	100101101001100000101110 (24 bits)
Octal	0o45514056
Hexadecimal	0x96982E

Divisor Catalog (8)

1 2 3 6 1,644,893 3,289,786 4,934,679 9,869,358

Collatz Trajectory (83 steps to reach 1)

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

9,869,358 4,934,679 14,804,038 7,402,019 22,206,058 11,103,029 33,309,088 16,654,544 8,327,272 4,163,636 2,081,818 1,040,909 3,122,728 1,561,364 780,682 390,341 1,171,024 585,512 292,756 146,378 73,189 219,568 109,784 54,892 27,446 13,723 41,170 20,585 61,756 30,878 15,439 46,318 23,159 69,478 34,739 104,218 52,109 156,328 78,164 39,082 19,541 58,624 29,312 14,656 7,328 3,664 1,832 916 458 229 688 344 172 86 43 130 65 196 98 49

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,869,357 Browse Full Index Next Integer #9,869,359 →