4,680,904

2³ × 585113

4,680,904 factors as 2^3 × 585113. Its 8 positive divisors give a proper-divisor sum of 4,095,806, so this integer is deficient. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^3 × 585113

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,776,710

Proper Divisor Sum 4,095,806

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #4680901 ← → #4680913

Radix Representation

Decimal	4680904
Binary	10001110110110011001000 (23 bits)
Octal	0o21666310
Hexadecimal	0x476CC8

Divisor Catalog (8)

1 2 4 8 585,113 1,170,226 2,340,452 4,680,904

Collatz Trajectory (162 steps to reach 1)

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

4,680,904 2,340,452 1,170,226 585,113 1,755,340 877,670 438,835 1,316,506 658,253 1,974,760 987,380 493,690 246,845 740,536 370,268 185,134 92,567 277,702 138,851 416,554 208,277 624,832 312,416 156,208 78,104 39,052 19,526 9,763 29,290 14,645 43,936 21,968 10,984 5,492 2,746 1,373 4,120 2,060 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47 142

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,680,903 Browse Full Index Next Integer #4,680,905 →