4,806,084

2² × 3 × 157 × 2551

4,806,084 factors as 2^2 × 3 × 157 × 2551. Its 24 positive divisors give a proper-divisor sum of 6,483,964, so this integer is abundant. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 157 × 2551

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 11,290,048

Proper Divisor Sum 6,483,964

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4806077 ← → #4806127

Radix Representation

Decimal	4806084
Binary	10010010101010111000100 (23 bits)
Octal	0o22252704
Hexadecimal	0x4955C4

Divisor Catalog (24)

Collatz Trajectory (118 steps to reach 1)

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

4,806,084 2,403,042 1,201,521 3,604,564 1,802,282 901,141 2,703,424 1,351,712 675,856 337,928 168,964 84,482 42,241 126,724 63,362 31,681 95,044 47,522 23,761 71,284 35,642 17,821 53,464 26,732 13,366 6,683 20,050 10,025 30,076 15,038 7,519 22,558 11,279 33,838 16,919 50,758 25,379 76,138 38,069 114,208 57,104 28,552 14,276 7,138 3,569 10,708 5,354 2,677 8,032 4,016 2,008 1,004 502 251 754 377 1,132 566 283 850

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,806,083 Browse Full Index Next Integer #4,806,085 →