9,854,778

2 × 3 × 1642463

9,854,778 factors as 2 × 3 × 1642463. Its 8 positive divisors give a proper-divisor sum of 9,854,790, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1642463

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 19,709,568

Proper Divisor Sum 9,854,790

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9854777 ← → #9854791

Radix Representation

Decimal	9854778
Binary	100101100101111100111010 (24 bits)
Octal	0o45457472
Hexadecimal	0x965F3A

Divisor Catalog (8)

1 2 3 6 1,642,463 3,284,926 4,927,389 9,854,778

Collatz Trajectory (83 steps to reach 1)

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

9,854,778 4,927,389 14,782,168 7,391,084 3,695,542 1,847,771 5,543,314 2,771,657 8,314,972 4,157,486 2,078,743 6,236,230 3,118,115 9,354,346 4,677,173 14,031,520 7,015,760 3,507,880 1,753,940 876,970 438,485 1,315,456 657,728 328,864 164,432 82,216 41,108 20,554 10,277 30,832 15,416 7,708 3,854 1,927 5,782 2,891 8,674 4,337 13,012 6,506 3,253 9,760 4,880 2,440 1,220 610 305 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,854,777 Browse Full Index Next Integer #9,854,779 →