4,881,678

2 × 3 × 813613

4,881,678 factors as 2 × 3 × 813613. Its 8 positive divisors give a proper-divisor sum of 4,881,690, so this integer is abundant. The Collatz stopping time is 113 steps.

Prime Factor Structure

Factorization String 2 × 3 × 813613

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,763,368

Proper Divisor Sum 4,881,690

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4881677 ← → #4881683

Radix Representation

Decimal	4881678
Binary	10010100111110100001110 (23 bits)
Octal	0o22476416
Hexadecimal	0x4A7D0E

Divisor Catalog (8)

1 2 3 6 813,613 1,627,226 2,440,839 4,881,678

Collatz Trajectory (113 steps to reach 1)

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

4,881,678 2,440,839 7,322,518 3,661,259 10,983,778 5,491,889 16,475,668 8,237,834 4,118,917 12,356,752 6,178,376 3,089,188 1,544,594 772,297 2,316,892 1,158,446 579,223 1,737,670 868,835 2,606,506 1,303,253 3,909,760 1,954,880 977,440 488,720 244,360 122,180 61,090 30,545 91,636 45,818 22,909 68,728 34,364 17,182 8,591 25,774 12,887 38,662 19,331 57,994 28,997 86,992 43,496 21,748 10,874 5,437 16,312 8,156 4,078 2,039 6,118 3,059 9,178 4,589 13,768 6,884 3,442 1,721 5,164

← Previous Integer #4,881,677 Browse Full Index Next Integer #4,881,679 →