4,670,708

2² × 7 × 31 × 5381

4,670,708 factors as 2^2 × 7 × 31 × 5381. Its 24 positive divisors give a proper-divisor sum of 4,973,836, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 31 × 5381

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,644,544

Proper Divisor Sum 4,973,836

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #4670707 ← → #4670737

Radix Representation

Decimal	4670708
Binary	10001110100010011110100 (23 bits)
Octal	0o21642364
Hexadecimal	0x4744F4

Divisor Catalog (24)

Collatz Trajectory (74 steps to reach 1)

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

4,670,708 2,335,354 1,167,677 3,503,032 1,751,516 875,758 437,879 1,313,638 656,819 1,970,458 985,229 2,955,688 1,477,844 738,922 369,461 1,108,384 554,192 277,096 138,548 69,274 34,637 103,912 51,956 25,978 12,989 38,968 19,484 9,742 4,871 14,614 7,307 21,922 10,961 32,884 16,442 8,221 24,664 12,332 6,166 3,083 9,250 4,625 13,876 6,938 3,469 10,408 5,204 2,602 1,301 3,904 1,952 976 488 244 122 61 184 92 46 23

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,670,707 Browse Full Index Next Integer #4,670,709 →